/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_unwindbound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-14 15:15:48,280 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 15:15:48,281 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 15:15:48,305 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 15:15:48,305 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 15:15:48,306 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 15:15:48,308 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 15:15:48,312 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 15:15:48,313 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 15:15:48,316 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 15:15:48,317 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 15:15:48,318 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 15:15:48,318 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 15:15:48,318 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 15:15:48,319 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 15:15:48,319 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 15:15:48,320 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 15:15:48,320 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 15:15:48,321 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 15:15:48,322 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 15:15:48,323 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 15:15:48,325 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 15:15:48,326 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 15:15:48,328 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 15:15:48,329 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 15:15:48,336 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 15:15:48,336 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 15:15:48,336 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 15:15:48,337 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 15:15:48,337 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 15:15:48,337 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 15:15:48,338 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 15:15:48,338 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 15:15:48,338 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 15:15:48,339 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 15:15:48,339 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 15:15:48,339 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 15:15:48,340 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 15:15:48,340 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 15:15:48,340 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 15:15:48,341 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 15:15:48,343 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 15:15:48,344 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-14 15:15:48,367 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 15:15:48,367 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 15:15:48,368 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-14 15:15:48,368 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-14 15:15:48,368 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-14 15:15:48,368 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-14 15:15:48,368 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-14 15:15:48,369 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-14 15:15:48,369 INFO L138 SettingsManager]: * Use SBE=true [2022-04-14 15:15:48,369 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 15:15:48,369 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 15:15:48,369 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 15:15:48,369 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 15:15:48,370 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 15:15:48,370 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 15:15:48,370 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 15:15:48,370 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 15:15:48,371 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 15:15:48,371 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 15:15:48,371 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 15:15:48,371 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 15:15:48,371 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 15:15:48,371 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 15:15:48,371 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 15:15:48,371 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 15:15:48,371 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 15:15:48,371 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-14 15:15:48,372 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-14 15:15:48,372 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 15:15:48,372 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-14 15:15:48,372 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-14 15:15:48,372 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-14 15:15:48,372 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-14 15:15:48,372 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-14 15:15:48,556 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 15:15:48,570 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 15:15:48,572 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 15:15:48,573 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 15:15:48,573 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 15:15:48,574 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound10.c [2022-04-14 15:15:48,627 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5221b5ca/93fe95f942214390842d6b68ef1dfa80/FLAG75dfc03be [2022-04-14 15:15:48,968 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 15:15:48,968 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound10.c [2022-04-14 15:15:48,972 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5221b5ca/93fe95f942214390842d6b68ef1dfa80/FLAG75dfc03be [2022-04-14 15:15:48,981 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5221b5ca/93fe95f942214390842d6b68ef1dfa80 [2022-04-14 15:15:48,983 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 15:15:48,984 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-14 15:15:48,986 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 15:15:48,986 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 15:15:48,988 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 15:15:48,989 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 03:15:48" (1/1) ... [2022-04-14 15:15:48,990 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42445ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:15:48, skipping insertion in model container [2022-04-14 15:15:48,990 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 03:15:48" (1/1) ... [2022-04-14 15:15:48,994 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 15:15:49,009 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 15:15:49,128 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound10.c[525,538] [2022-04-14 15:15:49,149 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 15:15:49,154 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 15:15:49,167 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_unwindbound10.c[525,538] [2022-04-14 15:15:49,179 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 15:15:49,205 INFO L208 MainTranslator]: Completed translation [2022-04-14 15:15:49,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:15:49 WrapperNode [2022-04-14 15:15:49,206 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 15:15:49,206 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 15:15:49,207 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 15:15:49,207 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 15:15:49,214 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:15:49" (1/1) ... [2022-04-14 15:15:49,214 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:15:49" (1/1) ... [2022-04-14 15:15:49,218 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:15:49" (1/1) ... [2022-04-14 15:15:49,218 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:15:49" (1/1) ... [2022-04-14 15:15:49,222 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:15:49" (1/1) ... [2022-04-14 15:15:49,225 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:15:49" (1/1) ... [2022-04-14 15:15:49,225 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:15:49" (1/1) ... [2022-04-14 15:15:49,227 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 15:15:49,227 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 15:15:49,232 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 15:15:49,232 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 15:15:49,233 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:15:49" (1/1) ... [2022-04-14 15:15:49,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 15:15:49,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:15:49,292 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-14 15:15:49,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-14 15:15:49,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 15:15:49,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 15:15:49,332 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 15:15:49,332 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-14 15:15:49,333 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-14 15:15:49,333 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 15:15:49,333 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-14 15:15:49,333 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 15:15:49,333 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 15:15:49,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 15:15:49,333 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-14 15:15:49,333 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-14 15:15:49,333 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-14 15:15:49,333 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 15:15:49,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 15:15:49,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 15:15:49,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 15:15:49,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 15:15:49,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 15:15:49,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 15:15:49,372 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 15:15:49,373 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 15:15:49,579 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 15:15:49,587 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 15:15:49,587 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-14 15:15:49,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 03:15:49 BoogieIcfgContainer [2022-04-14 15:15:49,588 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 15:15:49,589 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 15:15:49,589 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 15:15:49,591 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 15:15:49,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 03:15:48" (1/3) ... [2022-04-14 15:15:49,592 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15126c5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 03:15:49, skipping insertion in model container [2022-04-14 15:15:49,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:15:49" (2/3) ... [2022-04-14 15:15:49,592 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15126c5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 03:15:49, skipping insertion in model container [2022-04-14 15:15:49,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 03:15:49" (3/3) ... [2022-04-14 15:15:49,593 INFO L111 eAbstractionObserver]: Analyzing ICFG dijkstra-u_unwindbound10.c [2022-04-14 15:15:49,596 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-14 15:15:49,596 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 15:15:49,625 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 15:15:49,629 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-14 15:15:49,629 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 15:15:49,658 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-14 15:15:49,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-14 15:15:49,661 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:15:49,662 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:15:49,662 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:15:49,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:15:49,665 INFO L85 PathProgramCache]: Analyzing trace with hash -2024343623, now seen corresponding path program 1 times [2022-04-14 15:15:49,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:15:49,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563455100] [2022-04-14 15:15:49,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:15:49,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:15:49,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:15:49,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 15:15:49,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:15:49,793 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-14 15:15:49,793 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-14 15:15:49,793 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42#true} {42#true} #102#return; {42#true} is VALID [2022-04-14 15:15:49,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-14 15:15:49,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:15:49,799 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-14 15:15:49,800 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-14 15:15:49,800 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-14 15:15:49,800 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {42#true} #82#return; {43#false} is VALID [2022-04-14 15:15:49,801 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-14 15:15:49,802 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-14 15:15:49,802 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-14 15:15:49,802 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} #102#return; {42#true} is VALID [2022-04-14 15:15:49,802 INFO L272 TraceCheckUtils]: 4: Hoare triple {42#true} call #t~ret7 := main(); {42#true} is VALID [2022-04-14 15:15:49,802 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-14 15:15:49,802 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-14 15:15:49,802 INFO L290 TraceCheckUtils]: 7: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-14 15:15:49,803 INFO L290 TraceCheckUtils]: 8: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-14 15:15:49,803 INFO L290 TraceCheckUtils]: 9: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-14 15:15:49,803 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {43#false} {42#true} #82#return; {43#false} is VALID [2022-04-14 15:15:49,803 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-14 15:15:49,803 INFO L290 TraceCheckUtils]: 12: Hoare triple {43#false} assume !true; {43#false} is VALID [2022-04-14 15:15:49,804 INFO L290 TraceCheckUtils]: 13: Hoare triple {43#false} assume !true; {43#false} is VALID [2022-04-14 15:15:49,804 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-14 15:15:49,804 INFO L290 TraceCheckUtils]: 15: Hoare triple {43#false} ~cond := #in~cond; {43#false} is VALID [2022-04-14 15:15:49,804 INFO L290 TraceCheckUtils]: 16: Hoare triple {43#false} assume 0 == ~cond; {43#false} is VALID [2022-04-14 15:15:49,804 INFO L290 TraceCheckUtils]: 17: Hoare triple {43#false} assume !false; {43#false} is VALID [2022-04-14 15:15:49,804 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-14 15:15:49,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:15:49,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563455100] [2022-04-14 15:15:49,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563455100] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 15:15:49,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 15:15:49,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-14 15:15:49,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867322926] [2022-04-14 15:15:49,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:15:49,810 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-14 15:15:49,812 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:15:49,814 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-14 15:15:49,831 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-14 15:15:49,832 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-14 15:15:49,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:15:49,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-14 15:15:49,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 15:15:49,847 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-14 15:15:57,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:15:57,430 INFO L93 Difference]: Finished difference Result 70 states and 111 transitions. [2022-04-14 15:15:57,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-14 15:15:57,430 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-14 15:15:57,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:15:57,444 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-14 15:15:57,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-04-14 15:15:57,458 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-14 15:15:57,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-04-14 15:15:57,463 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 111 transitions. [2022-04-14 15:15:57,618 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-14 15:15:57,626 INFO L225 Difference]: With dead ends: 70 [2022-04-14 15:15:57,626 INFO L226 Difference]: Without dead ends: 35 [2022-04-14 15:15:57,629 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 15:15:57,631 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.5s IncrementalHoareTripleChecker+Time [2022-04-14 15:15:57,632 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 53 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-14 15:15:57,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-14 15:15:57,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-04-14 15:15:57,657 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:15:57,658 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-14 15:15:57,658 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-14 15:15:57,659 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-14 15:15:57,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:15:57,663 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-04-14 15:15:57,663 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2022-04-14 15:15:57,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:15:57,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:15:57,664 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-14 15:15:57,664 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-14 15:15:57,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:15:57,667 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-04-14 15:15:57,667 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2022-04-14 15:15:57,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:15:57,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:15:57,668 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:15:57,668 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:15:57,668 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-14 15:15:57,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2022-04-14 15:15:57,671 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 46 transitions. Word has length 18 [2022-04-14 15:15:57,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:15:57,672 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 46 transitions. [2022-04-14 15:15:57,672 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 15:15:57,672 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2022-04-14 15:15:57,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-14 15:15:57,672 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:15:57,673 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:15:57,673 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-14 15:15:57,673 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:15:57,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:15:57,674 INFO L85 PathProgramCache]: Analyzing trace with hash -96361696, now seen corresponding path program 1 times [2022-04-14 15:15:57,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:15:57,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250293145] [2022-04-14 15:15:57,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:15:57,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:15:57,687 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:15:57,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [907616073] [2022-04-14 15:15:57,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:15:57,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:15:57,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:15:57,689 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 15:15:57,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-14 15:15:57,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:15:57,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-14 15:15:57,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:15:57,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:15:57,905 INFO L272 TraceCheckUtils]: 0: Hoare triple {274#true} call ULTIMATE.init(); {274#true} is VALID [2022-04-14 15:15:57,906 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-14 15:15:57,906 INFO L290 TraceCheckUtils]: 2: Hoare triple {282#(<= ~counter~0 0)} assume true; {282#(<= ~counter~0 0)} is VALID [2022-04-14 15:15:57,907 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {282#(<= ~counter~0 0)} {274#true} #102#return; {282#(<= ~counter~0 0)} is VALID [2022-04-14 15:15:57,907 INFO L272 TraceCheckUtils]: 4: Hoare triple {282#(<= ~counter~0 0)} call #t~ret7 := main(); {282#(<= ~counter~0 0)} is VALID [2022-04-14 15:15:57,908 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-14 15:15:57,908 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-14 15:15:57,908 INFO L290 TraceCheckUtils]: 7: Hoare triple {282#(<= ~counter~0 0)} ~cond := #in~cond; {282#(<= ~counter~0 0)} is VALID [2022-04-14 15:15:57,909 INFO L290 TraceCheckUtils]: 8: Hoare triple {282#(<= ~counter~0 0)} assume !(0 == ~cond); {282#(<= ~counter~0 0)} is VALID [2022-04-14 15:15:57,909 INFO L290 TraceCheckUtils]: 9: Hoare triple {282#(<= ~counter~0 0)} assume true; {282#(<= ~counter~0 0)} is VALID [2022-04-14 15:15:57,910 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {282#(<= ~counter~0 0)} {282#(<= ~counter~0 0)} #82#return; {282#(<= ~counter~0 0)} is VALID [2022-04-14 15:15:57,910 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-14 15:15:57,910 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-14 15:15:57,911 INFO L290 TraceCheckUtils]: 13: Hoare triple {316#(<= |main_#t~post5| 0)} assume !(#t~post5 < 10);havoc #t~post5; {275#false} is VALID [2022-04-14 15:15:57,911 INFO L290 TraceCheckUtils]: 14: Hoare triple {275#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {275#false} is VALID [2022-04-14 15:15:57,911 INFO L290 TraceCheckUtils]: 15: Hoare triple {275#false} assume !(#t~post6 < 10);havoc #t~post6; {275#false} is VALID [2022-04-14 15:15:57,911 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-14 15:15:57,912 INFO L290 TraceCheckUtils]: 17: Hoare triple {275#false} ~cond := #in~cond; {275#false} is VALID [2022-04-14 15:15:57,912 INFO L290 TraceCheckUtils]: 18: Hoare triple {275#false} assume 0 == ~cond; {275#false} is VALID [2022-04-14 15:15:57,912 INFO L290 TraceCheckUtils]: 19: Hoare triple {275#false} assume !false; {275#false} is VALID [2022-04-14 15:15:57,912 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-14 15:15:57,912 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 15:15:57,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:15:57,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250293145] [2022-04-14 15:15:57,913 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:15:57,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907616073] [2022-04-14 15:15:57,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [907616073] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 15:15:57,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 15:15:57,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 15:15:57,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47286452] [2022-04-14 15:15:57,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:15:57,914 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-14 15:15:57,915 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:15:57,915 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-14 15:15:57,930 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-14 15:15:57,930 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 15:15:57,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:15:57,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 15:15:57,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 15:15:57,931 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-14 15:16:02,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:16:02,072 INFO L93 Difference]: Finished difference Result 55 states and 78 transitions. [2022-04-14 15:16:02,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 15:16:02,073 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-14 15:16:02,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:16:02,073 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-14 15:16:02,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-04-14 15:16:02,076 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-14 15:16:02,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-04-14 15:16:02,078 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 78 transitions. [2022-04-14 15:16:02,154 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-14 15:16:02,156 INFO L225 Difference]: With dead ends: 55 [2022-04-14 15:16:02,156 INFO L226 Difference]: Without dead ends: 36 [2022-04-14 15:16:02,156 INFO L912 BasicCegarLoop]: 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-14 15:16:02,157 INFO L913 BasicCegarLoop]: 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-14 15:16:02,157 INFO L914 BasicCegarLoop]: 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-14 15:16:02,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-14 15:16:02,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-14 15:16:02,164 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:16:02,165 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-14 15:16:02,165 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-14 15:16:02,165 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-14 15:16:02,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:16:02,169 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2022-04-14 15:16:02,169 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-14 15:16:02,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:16:02,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:16:02,172 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-14 15:16:02,172 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-14 15:16:02,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:16:02,175 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2022-04-14 15:16:02,175 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-14 15:16:02,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:16:02,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:16:02,175 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:16:02,175 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:16:02,176 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-14 15:16:02,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2022-04-14 15:16:02,177 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 20 [2022-04-14 15:16:02,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:16:02,178 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2022-04-14 15:16:02,178 INFO L479 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-14 15:16:02,178 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-14 15:16:02,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-14 15:16:02,178 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:16:02,178 INFO L499 BasicCegarLoop]: 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-14 15:16:02,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-14 15:16:02,396 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:16:02,397 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:16:02,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:16:02,398 INFO L85 PathProgramCache]: Analyzing trace with hash 962099791, now seen corresponding path program 1 times [2022-04-14 15:16:02,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:16:02,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715568986] [2022-04-14 15:16:02,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:16:02,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:16:02,410 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:16:02,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1546789681] [2022-04-14 15:16:02,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:16:02,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:16:02,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:16:02,431 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 15:16:02,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-14 15:16:02,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:16:02,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-14 15:16:02,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:16:02,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:16:02,604 INFO L272 TraceCheckUtils]: 0: Hoare triple {546#true} call ULTIMATE.init(); {546#true} is VALID [2022-04-14 15:16:02,604 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-14 15:16:02,605 INFO L290 TraceCheckUtils]: 2: Hoare triple {554#(<= ~counter~0 0)} assume true; {554#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:02,605 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {554#(<= ~counter~0 0)} {546#true} #102#return; {554#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:02,605 INFO L272 TraceCheckUtils]: 4: Hoare triple {554#(<= ~counter~0 0)} call #t~ret7 := main(); {554#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:02,606 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-14 15:16:02,606 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-14 15:16:02,606 INFO L290 TraceCheckUtils]: 7: Hoare triple {554#(<= ~counter~0 0)} ~cond := #in~cond; {554#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:02,607 INFO L290 TraceCheckUtils]: 8: Hoare triple {554#(<= ~counter~0 0)} assume !(0 == ~cond); {554#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:02,607 INFO L290 TraceCheckUtils]: 9: Hoare triple {554#(<= ~counter~0 0)} assume true; {554#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:02,607 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {554#(<= ~counter~0 0)} {554#(<= ~counter~0 0)} #82#return; {554#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:02,608 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-14 15:16:02,608 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-14 15:16:02,609 INFO L290 TraceCheckUtils]: 13: Hoare triple {588#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {588#(<= ~counter~0 1)} is VALID [2022-04-14 15:16:02,609 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-14 15:16:02,609 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-14 15:16:02,610 INFO L290 TraceCheckUtils]: 16: Hoare triple {598#(<= |main_#t~post6| 1)} assume !(#t~post6 < 10);havoc #t~post6; {547#false} is VALID [2022-04-14 15:16:02,610 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-14 15:16:02,610 INFO L290 TraceCheckUtils]: 18: Hoare triple {547#false} ~cond := #in~cond; {547#false} is VALID [2022-04-14 15:16:02,610 INFO L290 TraceCheckUtils]: 19: Hoare triple {547#false} assume 0 == ~cond; {547#false} is VALID [2022-04-14 15:16:02,610 INFO L290 TraceCheckUtils]: 20: Hoare triple {547#false} assume !false; {547#false} is VALID [2022-04-14 15:16:02,610 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-14 15:16:02,610 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 15:16:02,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:16:02,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715568986] [2022-04-14 15:16:02,611 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:16:02,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1546789681] [2022-04-14 15:16:02,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1546789681] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 15:16:02,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 15:16:02,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 15:16:02,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638214833] [2022-04-14 15:16:02,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:16:02,611 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-14 15:16:02,612 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:16:02,612 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-14 15:16:02,624 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-14 15:16:02,624 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 15:16:02,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:16:02,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 15:16:02,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-14 15:16:02,625 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-14 15:16:07,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:16:07,598 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2022-04-14 15:16:07,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 15:16:07,598 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-14 15:16:07,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:16:07,598 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-14 15:16:07,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-14 15:16:07,600 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-14 15:16:07,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-14 15:16:07,601 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-14 15:16:07,659 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-14 15:16:07,660 INFO L225 Difference]: With dead ends: 49 [2022-04-14 15:16:07,660 INFO L226 Difference]: Without dead ends: 40 [2022-04-14 15:16:07,661 INFO L912 BasicCegarLoop]: 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-14 15:16:07,661 INFO L913 BasicCegarLoop]: 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-14 15:16:07,662 INFO L914 BasicCegarLoop]: 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-14 15:16:07,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-14 15:16:07,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2022-04-14 15:16:07,667 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:16:07,668 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-14 15:16:07,668 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-14 15:16:07,668 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-14 15:16:07,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:16:07,670 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2022-04-14 15:16:07,670 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2022-04-14 15:16:07,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:16:07,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:16:07,670 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-14 15:16:07,671 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-14 15:16:07,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:16:07,672 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2022-04-14 15:16:07,673 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2022-04-14 15:16:07,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:16:07,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:16:07,673 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:16:07,673 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:16:07,673 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-14 15:16:07,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 52 transitions. [2022-04-14 15:16:07,675 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 52 transitions. Word has length 21 [2022-04-14 15:16:07,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:16:07,675 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 52 transitions. [2022-04-14 15:16:07,675 INFO L479 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-14 15:16:07,675 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 52 transitions. [2022-04-14 15:16:07,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-14 15:16:07,675 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:16:07,675 INFO L499 BasicCegarLoop]: 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-14 15:16:07,692 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-14 15:16:07,895 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-14 15:16:07,896 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:16:07,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:16:07,896 INFO L85 PathProgramCache]: Analyzing trace with hash 963589341, now seen corresponding path program 1 times [2022-04-14 15:16:07,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:16:07,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149760008] [2022-04-14 15:16:07,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:16:07,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:16:07,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:16:08,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 15:16:08,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:16:08,073 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-14 15:16:08,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-14 15:16:08,074 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {822#true} {822#true} #102#return; {822#true} is VALID [2022-04-14 15:16:08,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-14 15:16:08,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:16:08,077 INFO L290 TraceCheckUtils]: 0: Hoare triple {822#true} ~cond := #in~cond; {822#true} is VALID [2022-04-14 15:16:08,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {822#true} assume !(0 == ~cond); {822#true} is VALID [2022-04-14 15:16:08,077 INFO L290 TraceCheckUtils]: 2: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-14 15:16:08,077 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {822#true} {822#true} #82#return; {822#true} is VALID [2022-04-14 15:16:08,078 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-14 15:16:08,078 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-14 15:16:08,078 INFO L290 TraceCheckUtils]: 2: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-14 15:16:08,078 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {822#true} {822#true} #102#return; {822#true} is VALID [2022-04-14 15:16:08,078 INFO L272 TraceCheckUtils]: 4: Hoare triple {822#true} call #t~ret7 := main(); {822#true} is VALID [2022-04-14 15:16:08,078 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-14 15:16:08,079 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-14 15:16:08,079 INFO L290 TraceCheckUtils]: 7: Hoare triple {822#true} ~cond := #in~cond; {822#true} is VALID [2022-04-14 15:16:08,079 INFO L290 TraceCheckUtils]: 8: Hoare triple {822#true} assume !(0 == ~cond); {822#true} is VALID [2022-04-14 15:16:08,079 INFO L290 TraceCheckUtils]: 9: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-14 15:16:08,079 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {822#true} {822#true} #82#return; {822#true} is VALID [2022-04-14 15:16:08,080 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-14 15:16:08,080 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-14 15:16:08,080 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 < 10);havoc #t~post5; {831#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-14 15:16:08,081 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-14 15:16:08,082 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-14 15:16:08,082 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 < 10);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-14 15:16:08,083 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-14 15:16:08,083 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-14 15:16:08,084 INFO L290 TraceCheckUtils]: 19: Hoare triple {834#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {823#false} is VALID [2022-04-14 15:16:08,084 INFO L290 TraceCheckUtils]: 20: Hoare triple {823#false} assume !false; {823#false} is VALID [2022-04-14 15:16:08,084 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-14 15:16:08,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:16:08,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149760008] [2022-04-14 15:16:08,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149760008] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 15:16:08,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 15:16:08,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-14 15:16:08,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434887542] [2022-04-14 15:16:08,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:16:08,085 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-14 15:16:08,085 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:16:08,085 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-14 15:16:08,098 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-14 15:16:08,099 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-14 15:16:08,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:16:08,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-14 15:16:08,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-14 15:16:08,099 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-14 15:16:16,685 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 15:16:18,063 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 15:16:20,230 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-14 15:16:22,641 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 15:16:28,332 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-14 15:16:30,387 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 15:16:33,648 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 15:16:36,955 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 15:16:38,963 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-14 15:16:39,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:16:39,033 INFO L93 Difference]: Finished difference Result 72 states and 104 transitions. [2022-04-14 15:16:39,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-14 15:16:39,033 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-14 15:16:39,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:16:39,033 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-14 15:16:39,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2022-04-14 15:16:39,040 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-14 15:16:39,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2022-04-14 15:16:39,042 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 104 transitions. [2022-04-14 15:16:39,222 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-14 15:16:39,224 INFO L225 Difference]: With dead ends: 72 [2022-04-14 15:16:39,224 INFO L226 Difference]: Without dead ends: 51 [2022-04-14 15:16:39,225 INFO L912 BasicCegarLoop]: 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-14 15:16:39,225 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 24 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 37 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.3s IncrementalHoareTripleChecker+Time [2022-04-14 15:16:39,225 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 107 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 201 Invalid, 8 Unknown, 0 Unchecked, 23.3s Time] [2022-04-14 15:16:39,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-14 15:16:39,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-14 15:16:39,238 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:16:39,238 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-14 15:16:39,239 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-14 15:16:39,239 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-14 15:16:39,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:16:39,243 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-04-14 15:16:39,243 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2022-04-14 15:16:39,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:16:39,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:16:39,245 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-14 15:16:39,246 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-14 15:16:39,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:16:39,248 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-04-14 15:16:39,248 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2022-04-14 15:16:39,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:16:39,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:16:39,249 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:16:39,249 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:16:39,249 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-14 15:16:39,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 69 transitions. [2022-04-14 15:16:39,250 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 69 transitions. Word has length 21 [2022-04-14 15:16:39,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:16:39,251 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 69 transitions. [2022-04-14 15:16:39,251 INFO L479 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-14 15:16:39,261 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2022-04-14 15:16:39,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-14 15:16:39,261 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:16:39,261 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:16:39,261 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-14 15:16:39,261 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:16:39,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:16:39,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1701877900, now seen corresponding path program 1 times [2022-04-14 15:16:39,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:16:39,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86895602] [2022-04-14 15:16:39,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:16:39,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:16:39,280 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:16:39,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1475791717] [2022-04-14 15:16:39,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:16:39,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:16:39,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:16:39,283 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 15:16:39,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-14 15:16:39,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:16:39,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-14 15:16:39,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:16:39,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:16:39,433 INFO L272 TraceCheckUtils]: 0: Hoare triple {1137#true} call ULTIMATE.init(); {1137#true} is VALID [2022-04-14 15:16:39,434 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-14 15:16:39,434 INFO L290 TraceCheckUtils]: 2: Hoare triple {1145#(<= ~counter~0 0)} assume true; {1145#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:39,434 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1145#(<= ~counter~0 0)} {1137#true} #102#return; {1145#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:39,435 INFO L272 TraceCheckUtils]: 4: Hoare triple {1145#(<= ~counter~0 0)} call #t~ret7 := main(); {1145#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:39,435 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-14 15:16:39,435 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-14 15:16:39,435 INFO L290 TraceCheckUtils]: 7: Hoare triple {1145#(<= ~counter~0 0)} ~cond := #in~cond; {1145#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:39,438 INFO L290 TraceCheckUtils]: 8: Hoare triple {1145#(<= ~counter~0 0)} assume !(0 == ~cond); {1145#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:39,438 INFO L290 TraceCheckUtils]: 9: Hoare triple {1145#(<= ~counter~0 0)} assume true; {1145#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:39,438 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1145#(<= ~counter~0 0)} {1145#(<= ~counter~0 0)} #82#return; {1145#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:39,439 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-14 15:16:39,439 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-14 15:16:39,439 INFO L290 TraceCheckUtils]: 13: Hoare triple {1179#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {1179#(<= ~counter~0 1)} is VALID [2022-04-14 15:16:39,440 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-14 15:16:39,440 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-14 15:16:39,440 INFO L290 TraceCheckUtils]: 16: Hoare triple {1189#(<= |main_#t~post5| 1)} assume !(#t~post5 < 10);havoc #t~post5; {1138#false} is VALID [2022-04-14 15:16:39,440 INFO L290 TraceCheckUtils]: 17: Hoare triple {1138#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1138#false} is VALID [2022-04-14 15:16:39,440 INFO L290 TraceCheckUtils]: 18: Hoare triple {1138#false} assume !(#t~post6 < 10);havoc #t~post6; {1138#false} is VALID [2022-04-14 15:16:39,441 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-14 15:16:39,441 INFO L290 TraceCheckUtils]: 20: Hoare triple {1138#false} ~cond := #in~cond; {1138#false} is VALID [2022-04-14 15:16:39,441 INFO L290 TraceCheckUtils]: 21: Hoare triple {1138#false} assume 0 == ~cond; {1138#false} is VALID [2022-04-14 15:16:39,442 INFO L290 TraceCheckUtils]: 22: Hoare triple {1138#false} assume !false; {1138#false} is VALID [2022-04-14 15:16:39,442 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-14 15:16:39,443 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:16:39,579 INFO L290 TraceCheckUtils]: 22: Hoare triple {1138#false} assume !false; {1138#false} is VALID [2022-04-14 15:16:39,585 INFO L290 TraceCheckUtils]: 21: Hoare triple {1138#false} assume 0 == ~cond; {1138#false} is VALID [2022-04-14 15:16:39,595 INFO L290 TraceCheckUtils]: 20: Hoare triple {1138#false} ~cond := #in~cond; {1138#false} is VALID [2022-04-14 15:16:39,595 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-14 15:16:39,595 INFO L290 TraceCheckUtils]: 18: Hoare triple {1138#false} assume !(#t~post6 < 10);havoc #t~post6; {1138#false} is VALID [2022-04-14 15:16:39,596 INFO L290 TraceCheckUtils]: 17: Hoare triple {1138#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1138#false} is VALID [2022-04-14 15:16:39,598 INFO L290 TraceCheckUtils]: 16: Hoare triple {1229#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {1138#false} is VALID [2022-04-14 15:16:39,598 INFO L290 TraceCheckUtils]: 15: Hoare triple {1233#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1229#(< |main_#t~post5| 10)} is VALID [2022-04-14 15:16:39,599 INFO L290 TraceCheckUtils]: 14: Hoare triple {1233#(< ~counter~0 10)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {1233#(< ~counter~0 10)} is VALID [2022-04-14 15:16:39,599 INFO L290 TraceCheckUtils]: 13: Hoare triple {1233#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {1233#(< ~counter~0 10)} is VALID [2022-04-14 15:16:39,599 INFO L290 TraceCheckUtils]: 12: Hoare triple {1243#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1233#(< ~counter~0 10)} is VALID [2022-04-14 15:16:39,600 INFO L290 TraceCheckUtils]: 11: Hoare triple {1243#(< ~counter~0 9)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1243#(< ~counter~0 9)} is VALID [2022-04-14 15:16:39,600 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1137#true} {1243#(< ~counter~0 9)} #82#return; {1243#(< ~counter~0 9)} is VALID [2022-04-14 15:16:39,600 INFO L290 TraceCheckUtils]: 9: Hoare triple {1137#true} assume true; {1137#true} is VALID [2022-04-14 15:16:39,600 INFO L290 TraceCheckUtils]: 8: Hoare triple {1137#true} assume !(0 == ~cond); {1137#true} is VALID [2022-04-14 15:16:39,600 INFO L290 TraceCheckUtils]: 7: Hoare triple {1137#true} ~cond := #in~cond; {1137#true} is VALID [2022-04-14 15:16:39,600 INFO L272 TraceCheckUtils]: 6: Hoare triple {1243#(< ~counter~0 9)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1137#true} is VALID [2022-04-14 15:16:39,600 INFO L290 TraceCheckUtils]: 5: Hoare triple {1243#(< ~counter~0 9)} 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 9)} is VALID [2022-04-14 15:16:39,601 INFO L272 TraceCheckUtils]: 4: Hoare triple {1243#(< ~counter~0 9)} call #t~ret7 := main(); {1243#(< ~counter~0 9)} is VALID [2022-04-14 15:16:39,601 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1243#(< ~counter~0 9)} {1137#true} #102#return; {1243#(< ~counter~0 9)} is VALID [2022-04-14 15:16:39,601 INFO L290 TraceCheckUtils]: 2: Hoare triple {1243#(< ~counter~0 9)} assume true; {1243#(< ~counter~0 9)} is VALID [2022-04-14 15:16:39,602 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 9)} is VALID [2022-04-14 15:16:39,602 INFO L272 TraceCheckUtils]: 0: Hoare triple {1137#true} call ULTIMATE.init(); {1137#true} is VALID [2022-04-14 15:16:39,602 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-14 15:16:39,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:16:39,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86895602] [2022-04-14 15:16:39,602 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:16:39,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475791717] [2022-04-14 15:16:39,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1475791717] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 15:16:39,602 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 15:16:39,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-14 15:16:39,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16396754] [2022-04-14 15:16:39,603 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 15:16:39,603 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-14 15:16:39,603 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:16:39,603 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-14 15:16:39,638 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-14 15:16:39,638 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-14 15:16:39,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:16:39,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-14 15:16:39,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-14 15:16:39,639 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-14 15:16:43,893 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 15:16:50,087 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 15:17:08,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:17:08,701 INFO L93 Difference]: Finished difference Result 104 states and 146 transitions. [2022-04-14 15:17:08,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-14 15:17:08,701 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-14 15:17:08,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:17:08,701 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-14 15:17:08,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 143 transitions. [2022-04-14 15:17:08,703 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-14 15:17:08,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 143 transitions. [2022-04-14 15:17:08,705 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 143 transitions. [2022-04-14 15:17:08,826 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:17:08,839 INFO L225 Difference]: With dead ends: 104 [2022-04-14 15:17:08,839 INFO L226 Difference]: Without dead ends: 83 [2022-04-14 15:17:08,840 INFO L912 BasicCegarLoop]: 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-14 15:17:08,841 INFO L913 BasicCegarLoop]: 64 mSDtfsCounter, 70 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 24 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2022-04-14 15:17:08,841 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 267 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 97 Invalid, 1 Unknown, 0 Unchecked, 9.6s Time] [2022-04-14 15:17:08,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-04-14 15:17:08,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 77. [2022-04-14 15:17:08,865 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:17:08,865 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand has 77 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 45 states have internal predecessors, (55), 28 states have call successors, (28), 7 states have call predecessors, (28), 5 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-14 15:17:08,866 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand has 77 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 45 states have internal predecessors, (55), 28 states have call successors, (28), 7 states have call predecessors, (28), 5 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-14 15:17:08,866 INFO L87 Difference]: Start difference. First operand 83 states. Second operand has 77 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 45 states have internal predecessors, (55), 28 states have call successors, (28), 7 states have call predecessors, (28), 5 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-14 15:17:08,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:17:08,870 INFO L93 Difference]: Finished difference Result 83 states and 112 transitions. [2022-04-14 15:17:08,870 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 112 transitions. [2022-04-14 15:17:08,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:17:08,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:17:08,871 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 45 states have internal predecessors, (55), 28 states have call successors, (28), 7 states have call predecessors, (28), 5 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 83 states. [2022-04-14 15:17:08,871 INFO L87 Difference]: Start difference. First operand has 77 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 45 states have internal predecessors, (55), 28 states have call successors, (28), 7 states have call predecessors, (28), 5 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 83 states. [2022-04-14 15:17:08,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:17:08,874 INFO L93 Difference]: Finished difference Result 83 states and 112 transitions. [2022-04-14 15:17:08,874 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 112 transitions. [2022-04-14 15:17:08,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:17:08,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:17:08,875 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:17:08,875 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:17:08,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 45 states have internal predecessors, (55), 28 states have call successors, (28), 7 states have call predecessors, (28), 5 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-14 15:17:08,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 107 transitions. [2022-04-14 15:17:08,878 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 107 transitions. Word has length 23 [2022-04-14 15:17:08,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:17:08,878 INFO L478 AbstractCegarLoop]: Abstraction has 77 states and 107 transitions. [2022-04-14 15:17:08,878 INFO L479 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-14 15:17:08,879 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 107 transitions. [2022-04-14 15:17:08,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-14 15:17:08,879 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:17:08,879 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:17:08,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-14 15:17:09,096 WARN L460 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-14 15:17:09,096 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:17:09,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:17:09,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1564262277, now seen corresponding path program 1 times [2022-04-14 15:17:09,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:17:09,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531796748] [2022-04-14 15:17:09,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:17:09,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:17:09,120 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:17:09,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [939806107] [2022-04-14 15:17:09,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:17:09,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:17:09,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:17:09,128 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 15:17:09,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-14 15:17:09,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:17:09,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-14 15:17:09,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:17:09,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:17:09,317 INFO L272 TraceCheckUtils]: 0: Hoare triple {1725#true} call ULTIMATE.init(); {1725#true} is VALID [2022-04-14 15:17:09,318 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-14 15:17:09,318 INFO L290 TraceCheckUtils]: 2: Hoare triple {1733#(<= ~counter~0 0)} assume true; {1733#(<= ~counter~0 0)} is VALID [2022-04-14 15:17:09,319 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1733#(<= ~counter~0 0)} {1725#true} #102#return; {1733#(<= ~counter~0 0)} is VALID [2022-04-14 15:17:09,319 INFO L272 TraceCheckUtils]: 4: Hoare triple {1733#(<= ~counter~0 0)} call #t~ret7 := main(); {1733#(<= ~counter~0 0)} is VALID [2022-04-14 15:17:09,320 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-14 15:17:09,320 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-14 15:17:09,321 INFO L290 TraceCheckUtils]: 7: Hoare triple {1733#(<= ~counter~0 0)} ~cond := #in~cond; {1733#(<= ~counter~0 0)} is VALID [2022-04-14 15:17:09,321 INFO L290 TraceCheckUtils]: 8: Hoare triple {1733#(<= ~counter~0 0)} assume !(0 == ~cond); {1733#(<= ~counter~0 0)} is VALID [2022-04-14 15:17:09,321 INFO L290 TraceCheckUtils]: 9: Hoare triple {1733#(<= ~counter~0 0)} assume true; {1733#(<= ~counter~0 0)} is VALID [2022-04-14 15:17:09,322 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1733#(<= ~counter~0 0)} {1733#(<= ~counter~0 0)} #82#return; {1733#(<= ~counter~0 0)} is VALID [2022-04-14 15:17:09,322 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-14 15:17:09,323 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-14 15:17:09,323 INFO L290 TraceCheckUtils]: 13: Hoare triple {1767#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {1767#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:09,323 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-14 15:17:09,324 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-14 15:17:09,324 INFO L290 TraceCheckUtils]: 16: Hoare triple {1777#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {1777#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:09,325 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-14 15:17:09,325 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-14 15:17:09,326 INFO L290 TraceCheckUtils]: 19: Hoare triple {1787#(<= |main_#t~post6| 2)} assume !(#t~post6 < 10);havoc #t~post6; {1726#false} is VALID [2022-04-14 15:17:09,326 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-14 15:17:09,326 INFO L290 TraceCheckUtils]: 21: Hoare triple {1726#false} ~cond := #in~cond; {1726#false} is VALID [2022-04-14 15:17:09,326 INFO L290 TraceCheckUtils]: 22: Hoare triple {1726#false} assume 0 == ~cond; {1726#false} is VALID [2022-04-14 15:17:09,326 INFO L290 TraceCheckUtils]: 23: Hoare triple {1726#false} assume !false; {1726#false} is VALID [2022-04-14 15:17:09,326 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-14 15:17:09,326 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:17:09,523 INFO L290 TraceCheckUtils]: 23: Hoare triple {1726#false} assume !false; {1726#false} is VALID [2022-04-14 15:17:09,523 INFO L290 TraceCheckUtils]: 22: Hoare triple {1726#false} assume 0 == ~cond; {1726#false} is VALID [2022-04-14 15:17:09,523 INFO L290 TraceCheckUtils]: 21: Hoare triple {1726#false} ~cond := #in~cond; {1726#false} is VALID [2022-04-14 15:17:09,523 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-14 15:17:09,523 INFO L290 TraceCheckUtils]: 19: Hoare triple {1815#(< |main_#t~post6| 10)} assume !(#t~post6 < 10);havoc #t~post6; {1726#false} is VALID [2022-04-14 15:17:09,524 INFO L290 TraceCheckUtils]: 18: Hoare triple {1819#(< ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1815#(< |main_#t~post6| 10)} is VALID [2022-04-14 15:17:09,524 INFO L290 TraceCheckUtils]: 17: Hoare triple {1819#(< ~counter~0 10)} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {1819#(< ~counter~0 10)} is VALID [2022-04-14 15:17:09,525 INFO L290 TraceCheckUtils]: 16: Hoare triple {1819#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {1819#(< ~counter~0 10)} is VALID [2022-04-14 15:17:09,525 INFO L290 TraceCheckUtils]: 15: Hoare triple {1829#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1819#(< ~counter~0 10)} is VALID [2022-04-14 15:17:09,526 INFO L290 TraceCheckUtils]: 14: Hoare triple {1829#(< ~counter~0 9)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {1829#(< ~counter~0 9)} is VALID [2022-04-14 15:17:09,526 INFO L290 TraceCheckUtils]: 13: Hoare triple {1829#(< ~counter~0 9)} assume !!(#t~post5 < 10);havoc #t~post5; {1829#(< ~counter~0 9)} is VALID [2022-04-14 15:17:09,526 INFO L290 TraceCheckUtils]: 12: Hoare triple {1839#(< ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1829#(< ~counter~0 9)} is VALID [2022-04-14 15:17:09,527 INFO L290 TraceCheckUtils]: 11: Hoare triple {1839#(< ~counter~0 8)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1839#(< ~counter~0 8)} is VALID [2022-04-14 15:17:09,528 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1725#true} {1839#(< ~counter~0 8)} #82#return; {1839#(< ~counter~0 8)} is VALID [2022-04-14 15:17:09,528 INFO L290 TraceCheckUtils]: 9: Hoare triple {1725#true} assume true; {1725#true} is VALID [2022-04-14 15:17:09,528 INFO L290 TraceCheckUtils]: 8: Hoare triple {1725#true} assume !(0 == ~cond); {1725#true} is VALID [2022-04-14 15:17:09,528 INFO L290 TraceCheckUtils]: 7: Hoare triple {1725#true} ~cond := #in~cond; {1725#true} is VALID [2022-04-14 15:17:09,528 INFO L272 TraceCheckUtils]: 6: Hoare triple {1839#(< ~counter~0 8)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1725#true} is VALID [2022-04-14 15:17:09,528 INFO L290 TraceCheckUtils]: 5: Hoare triple {1839#(< ~counter~0 8)} 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 8)} is VALID [2022-04-14 15:17:09,529 INFO L272 TraceCheckUtils]: 4: Hoare triple {1839#(< ~counter~0 8)} call #t~ret7 := main(); {1839#(< ~counter~0 8)} is VALID [2022-04-14 15:17:09,529 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1839#(< ~counter~0 8)} {1725#true} #102#return; {1839#(< ~counter~0 8)} is VALID [2022-04-14 15:17:09,530 INFO L290 TraceCheckUtils]: 2: Hoare triple {1839#(< ~counter~0 8)} assume true; {1839#(< ~counter~0 8)} is VALID [2022-04-14 15:17:09,530 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 8)} is VALID [2022-04-14 15:17:09,530 INFO L272 TraceCheckUtils]: 0: Hoare triple {1725#true} call ULTIMATE.init(); {1725#true} is VALID [2022-04-14 15:17:09,530 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-14 15:17:09,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:17:09,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531796748] [2022-04-14 15:17:09,531 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:17:09,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939806107] [2022-04-14 15:17:09,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939806107] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 15:17:09,531 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 15:17:09,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-14 15:17:09,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483198592] [2022-04-14 15:17:09,531 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 15:17:09,532 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-14 15:17:09,532 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:17:09,532 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-14 15:17:09,568 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-14 15:17:09,568 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-14 15:17:09,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:17:09,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-14 15:17:09,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-14 15:17:09,569 INFO L87 Difference]: Start difference. First operand 77 states and 107 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-14 15:17:12,399 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 15:17:15,437 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 15:17:20,657 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 15:17:25,728 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-14 15:17:31,490 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-14 15:17:34,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:17:34,332 INFO L93 Difference]: Finished difference Result 147 states and 203 transitions. [2022-04-14 15:17:34,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-14 15:17:34,332 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-14 15:17:34,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:17:34,332 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-14 15:17:34,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 189 transitions. [2022-04-14 15:17:34,335 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-14 15:17:34,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 189 transitions. [2022-04-14 15:17:34,338 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 189 transitions. [2022-04-14 15:17:34,499 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-14 15:17:34,501 INFO L225 Difference]: With dead ends: 147 [2022-04-14 15:17:34,501 INFO L226 Difference]: Without dead ends: 131 [2022-04-14 15:17:34,502 INFO L912 BasicCegarLoop]: 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-14 15:17:34,502 INFO L913 BasicCegarLoop]: 78 mSDtfsCounter, 148 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 71 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.4s IncrementalHoareTripleChecker+Time [2022-04-14 15:17:34,503 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 342 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 132 Invalid, 5 Unknown, 0 Unchecked, 15.4s Time] [2022-04-14 15:17:34,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-04-14 15:17:34,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 122. [2022-04-14 15:17:34,547 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:17:34,547 INFO L82 GeneralOperation]: Start isEquivalent. First operand 131 states. Second operand has 122 states, 67 states have (on average 1.328358208955224) internal successors, (89), 71 states have internal predecessors, (89), 46 states have call successors, (46), 10 states have call predecessors, (46), 8 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-14 15:17:34,548 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand has 122 states, 67 states have (on average 1.328358208955224) internal successors, (89), 71 states have internal predecessors, (89), 46 states have call successors, (46), 10 states have call predecessors, (46), 8 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-14 15:17:34,548 INFO L87 Difference]: Start difference. First operand 131 states. Second operand has 122 states, 67 states have (on average 1.328358208955224) internal successors, (89), 71 states have internal predecessors, (89), 46 states have call successors, (46), 10 states have call predecessors, (46), 8 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-14 15:17:34,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:17:34,552 INFO L93 Difference]: Finished difference Result 131 states and 180 transitions. [2022-04-14 15:17:34,552 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 180 transitions. [2022-04-14 15:17:34,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:17:34,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:17:34,553 INFO L74 IsIncluded]: Start isIncluded. First operand has 122 states, 67 states have (on average 1.328358208955224) internal successors, (89), 71 states have internal predecessors, (89), 46 states have call successors, (46), 10 states have call predecessors, (46), 8 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) Second operand 131 states. [2022-04-14 15:17:34,553 INFO L87 Difference]: Start difference. First operand has 122 states, 67 states have (on average 1.328358208955224) internal successors, (89), 71 states have internal predecessors, (89), 46 states have call successors, (46), 10 states have call predecessors, (46), 8 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) Second operand 131 states. [2022-04-14 15:17:34,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:17:34,557 INFO L93 Difference]: Finished difference Result 131 states and 180 transitions. [2022-04-14 15:17:34,557 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 180 transitions. [2022-04-14 15:17:34,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:17:34,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:17:34,557 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:17:34,557 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:17:34,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 67 states have (on average 1.328358208955224) internal successors, (89), 71 states have internal predecessors, (89), 46 states have call successors, (46), 10 states have call predecessors, (46), 8 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-14 15:17:34,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 175 transitions. [2022-04-14 15:17:34,561 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 175 transitions. Word has length 24 [2022-04-14 15:17:34,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:17:34,561 INFO L478 AbstractCegarLoop]: Abstraction has 122 states and 175 transitions. [2022-04-14 15:17:34,561 INFO L479 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-14 15:17:34,561 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 175 transitions. [2022-04-14 15:17:34,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-14 15:17:34,561 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:17:34,561 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:17:34,577 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-14 15:17:34,777 WARN L460 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-14 15:17:34,777 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:17:34,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:17:34,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1562772727, now seen corresponding path program 1 times [2022-04-14 15:17:34,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:17:34,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921118206] [2022-04-14 15:17:34,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:17:34,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:17:34,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:17:34,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 15:17:34,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:17:34,968 INFO L290 TraceCheckUtils]: 0: Hoare triple {2564#(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; {2550#true} is VALID [2022-04-14 15:17:34,968 INFO L290 TraceCheckUtils]: 1: Hoare triple {2550#true} assume true; {2550#true} is VALID [2022-04-14 15:17:34,968 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2550#true} {2550#true} #102#return; {2550#true} is VALID [2022-04-14 15:17:34,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-14 15:17:34,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:17:34,980 INFO L290 TraceCheckUtils]: 0: Hoare triple {2550#true} ~cond := #in~cond; {2550#true} is VALID [2022-04-14 15:17:34,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {2550#true} assume !(0 == ~cond); {2550#true} is VALID [2022-04-14 15:17:34,980 INFO L290 TraceCheckUtils]: 2: Hoare triple {2550#true} assume true; {2550#true} is VALID [2022-04-14 15:17:34,981 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2550#true} {2550#true} #82#return; {2550#true} is VALID [2022-04-14 15:17:34,981 INFO L272 TraceCheckUtils]: 0: Hoare triple {2550#true} call ULTIMATE.init(); {2564#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 15:17:34,981 INFO L290 TraceCheckUtils]: 1: Hoare triple {2564#(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; {2550#true} is VALID [2022-04-14 15:17:34,981 INFO L290 TraceCheckUtils]: 2: Hoare triple {2550#true} assume true; {2550#true} is VALID [2022-04-14 15:17:34,981 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2550#true} {2550#true} #102#return; {2550#true} is VALID [2022-04-14 15:17:34,981 INFO L272 TraceCheckUtils]: 4: Hoare triple {2550#true} call #t~ret7 := main(); {2550#true} is VALID [2022-04-14 15:17:34,982 INFO L290 TraceCheckUtils]: 5: Hoare triple {2550#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {2550#true} is VALID [2022-04-14 15:17:34,982 INFO L272 TraceCheckUtils]: 6: Hoare triple {2550#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {2550#true} is VALID [2022-04-14 15:17:34,982 INFO L290 TraceCheckUtils]: 7: Hoare triple {2550#true} ~cond := #in~cond; {2550#true} is VALID [2022-04-14 15:17:34,982 INFO L290 TraceCheckUtils]: 8: Hoare triple {2550#true} assume !(0 == ~cond); {2550#true} is VALID [2022-04-14 15:17:34,982 INFO L290 TraceCheckUtils]: 9: Hoare triple {2550#true} assume true; {2550#true} is VALID [2022-04-14 15:17:34,982 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2550#true} {2550#true} #82#return; {2550#true} is VALID [2022-04-14 15:17:34,985 INFO L290 TraceCheckUtils]: 11: Hoare triple {2550#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {2559#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-14 15:17:34,985 INFO L290 TraceCheckUtils]: 12: Hoare triple {2559#(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; {2559#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-14 15:17:34,985 INFO L290 TraceCheckUtils]: 13: Hoare triple {2559#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !!(#t~post5 < 10);havoc #t~post5; {2559#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-14 15:17:34,986 INFO L290 TraceCheckUtils]: 14: Hoare triple {2559#(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; {2560#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-14 15:17:34,986 INFO L290 TraceCheckUtils]: 15: Hoare triple {2560#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2560#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-14 15:17:34,987 INFO L290 TraceCheckUtils]: 16: Hoare triple {2560#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !!(#t~post5 < 10);havoc #t~post5; {2560#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-14 15:17:34,987 INFO L290 TraceCheckUtils]: 17: Hoare triple {2560#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {2561#(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-14 15:17:34,988 INFO L290 TraceCheckUtils]: 18: Hoare triple {2561#(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; {2561#(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-14 15:17:34,988 INFO L290 TraceCheckUtils]: 19: Hoare triple {2561#(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 < 10);havoc #t~post6; {2561#(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-14 15:17:34,990 INFO L272 TraceCheckUtils]: 20: Hoare triple {2561#(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)); {2562#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:17:34,990 INFO L290 TraceCheckUtils]: 21: Hoare triple {2562#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2563#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 15:17:34,991 INFO L290 TraceCheckUtils]: 22: Hoare triple {2563#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2551#false} is VALID [2022-04-14 15:17:34,991 INFO L290 TraceCheckUtils]: 23: Hoare triple {2551#false} assume !false; {2551#false} is VALID [2022-04-14 15:17:34,991 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-14 15:17:34,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:17:34,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921118206] [2022-04-14 15:17:34,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921118206] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 15:17:34,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834876384] [2022-04-14 15:17:34,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:17:34,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:17:34,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:17:34,995 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 15:17:34,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-14 15:17:35,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:17:35,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-14 15:17:35,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:17:35,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:17:35,308 INFO L272 TraceCheckUtils]: 0: Hoare triple {2550#true} call ULTIMATE.init(); {2550#true} is VALID [2022-04-14 15:17:35,308 INFO L290 TraceCheckUtils]: 1: Hoare triple {2550#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; {2550#true} is VALID [2022-04-14 15:17:35,308 INFO L290 TraceCheckUtils]: 2: Hoare triple {2550#true} assume true; {2550#true} is VALID [2022-04-14 15:17:35,308 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2550#true} {2550#true} #102#return; {2550#true} is VALID [2022-04-14 15:17:35,308 INFO L272 TraceCheckUtils]: 4: Hoare triple {2550#true} call #t~ret7 := main(); {2550#true} is VALID [2022-04-14 15:17:35,308 INFO L290 TraceCheckUtils]: 5: Hoare triple {2550#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {2550#true} is VALID [2022-04-14 15:17:35,309 INFO L272 TraceCheckUtils]: 6: Hoare triple {2550#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {2550#true} is VALID [2022-04-14 15:17:35,309 INFO L290 TraceCheckUtils]: 7: Hoare triple {2550#true} ~cond := #in~cond; {2550#true} is VALID [2022-04-14 15:17:35,309 INFO L290 TraceCheckUtils]: 8: Hoare triple {2550#true} assume !(0 == ~cond); {2550#true} is VALID [2022-04-14 15:17:35,309 INFO L290 TraceCheckUtils]: 9: Hoare triple {2550#true} assume true; {2550#true} is VALID [2022-04-14 15:17:35,309 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2550#true} {2550#true} #82#return; {2550#true} is VALID [2022-04-14 15:17:35,309 INFO L290 TraceCheckUtils]: 11: Hoare triple {2550#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {2559#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-14 15:17:35,310 INFO L290 TraceCheckUtils]: 12: Hoare triple {2559#(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; {2559#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-14 15:17:35,310 INFO L290 TraceCheckUtils]: 13: Hoare triple {2559#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !!(#t~post5 < 10);havoc #t~post5; {2559#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-14 15:17:35,311 INFO L290 TraceCheckUtils]: 14: Hoare triple {2559#(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; {2610#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-14 15:17:35,311 INFO L290 TraceCheckUtils]: 15: Hoare triple {2610#(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; {2610#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-14 15:17:35,312 INFO L290 TraceCheckUtils]: 16: Hoare triple {2610#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !!(#t~post5 < 10);havoc #t~post5; {2610#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-14 15:17:35,313 INFO L290 TraceCheckUtils]: 17: Hoare triple {2610#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {2620#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} is VALID [2022-04-14 15:17:35,313 INFO L290 TraceCheckUtils]: 18: Hoare triple {2620#(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; {2620#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} is VALID [2022-04-14 15:17:35,313 INFO L290 TraceCheckUtils]: 19: Hoare triple {2620#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} assume !!(#t~post6 < 10);havoc #t~post6; {2620#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} is VALID [2022-04-14 15:17:35,314 INFO L272 TraceCheckUtils]: 20: Hoare triple {2620#(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)); {2630#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:17:35,315 INFO L290 TraceCheckUtils]: 21: Hoare triple {2630#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2634#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:17:35,315 INFO L290 TraceCheckUtils]: 22: Hoare triple {2634#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2551#false} is VALID [2022-04-14 15:17:35,315 INFO L290 TraceCheckUtils]: 23: Hoare triple {2551#false} assume !false; {2551#false} is VALID [2022-04-14 15:17:35,315 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-14 15:17:35,315 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:17:35,521 INFO L290 TraceCheckUtils]: 23: Hoare triple {2551#false} assume !false; {2551#false} is VALID [2022-04-14 15:17:35,526 INFO L290 TraceCheckUtils]: 22: Hoare triple {2634#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2551#false} is VALID [2022-04-14 15:17:35,526 INFO L290 TraceCheckUtils]: 21: Hoare triple {2630#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2634#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:17:35,527 INFO L272 TraceCheckUtils]: 20: Hoare triple {2650#(< (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)); {2630#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:17:35,527 INFO L290 TraceCheckUtils]: 19: Hoare triple {2650#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} assume !!(#t~post6 < 10);havoc #t~post6; {2650#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} is VALID [2022-04-14 15:17:35,528 INFO L290 TraceCheckUtils]: 18: Hoare triple {2650#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2650#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} is VALID [2022-04-14 15:17:35,528 INFO L290 TraceCheckUtils]: 17: Hoare triple {2660#(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); {2650#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} is VALID [2022-04-14 15:17:35,529 INFO L290 TraceCheckUtils]: 16: Hoare triple {2660#(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 < 10);havoc #t~post5; {2660#(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-14 15:17:35,529 INFO L290 TraceCheckUtils]: 15: Hoare triple {2660#(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; {2660#(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-14 15:17:35,537 INFO L290 TraceCheckUtils]: 14: Hoare triple {2670#(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; {2660#(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-14 15:17:35,538 INFO L290 TraceCheckUtils]: 13: Hoare triple {2670#(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 < 10);havoc #t~post5; {2670#(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-14 15:17:35,538 INFO L290 TraceCheckUtils]: 12: Hoare triple {2670#(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; {2670#(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-14 15:17:35,538 INFO L290 TraceCheckUtils]: 11: Hoare triple {2550#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {2670#(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-14 15:17:35,539 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2550#true} {2550#true} #82#return; {2550#true} is VALID [2022-04-14 15:17:35,539 INFO L290 TraceCheckUtils]: 9: Hoare triple {2550#true} assume true; {2550#true} is VALID [2022-04-14 15:17:35,539 INFO L290 TraceCheckUtils]: 8: Hoare triple {2550#true} assume !(0 == ~cond); {2550#true} is VALID [2022-04-14 15:17:35,539 INFO L290 TraceCheckUtils]: 7: Hoare triple {2550#true} ~cond := #in~cond; {2550#true} is VALID [2022-04-14 15:17:35,539 INFO L272 TraceCheckUtils]: 6: Hoare triple {2550#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {2550#true} is VALID [2022-04-14 15:17:35,539 INFO L290 TraceCheckUtils]: 5: Hoare triple {2550#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {2550#true} is VALID [2022-04-14 15:17:35,539 INFO L272 TraceCheckUtils]: 4: Hoare triple {2550#true} call #t~ret7 := main(); {2550#true} is VALID [2022-04-14 15:17:35,539 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2550#true} {2550#true} #102#return; {2550#true} is VALID [2022-04-14 15:17:35,551 INFO L290 TraceCheckUtils]: 2: Hoare triple {2550#true} assume true; {2550#true} is VALID [2022-04-14 15:17:35,551 INFO L290 TraceCheckUtils]: 1: Hoare triple {2550#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; {2550#true} is VALID [2022-04-14 15:17:35,551 INFO L272 TraceCheckUtils]: 0: Hoare triple {2550#true} call ULTIMATE.init(); {2550#true} is VALID [2022-04-14 15:17:35,551 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-14 15:17:35,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [834876384] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 15:17:35,551 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-14 15:17:35,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2022-04-14 15:17:35,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236659310] [2022-04-14 15:17:35,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-14 15:17:35,560 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-14 15:17:35,560 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:17:35,560 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-14 15:17:35,600 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:17:35,600 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-14 15:17:35,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:17:35,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-14 15:17:35,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-04-14 15:17:35,601 INFO L87 Difference]: Start difference. First operand 122 states and 175 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-14 15:17:41,134 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 15:17:47,584 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 15:17:52,564 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 15:17:54,566 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 15:17:56,635 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-14 15:18:00,187 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 15:18:09,091 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 15:18:16,005 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-14 15:18:22,821 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-14 15:18:28,140 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-14 15:18:31,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:18:31,040 INFO L93 Difference]: Finished difference Result 196 states and 286 transitions. [2022-04-14 15:18:31,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-14 15:18:31,040 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-14 15:18:31,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:18:31,040 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-14 15:18:31,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 144 transitions. [2022-04-14 15:18:31,043 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-14 15:18:31,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 144 transitions. [2022-04-14 15:18:31,045 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 144 transitions. [2022-04-14 15:18:31,705 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-14 15:18:31,708 INFO L225 Difference]: With dead ends: 196 [2022-04-14 15:18:31,709 INFO L226 Difference]: Without dead ends: 179 [2022-04-14 15:18:31,709 INFO L912 BasicCegarLoop]: 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-14 15:18:31,710 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 49 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 137 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.9s IncrementalHoareTripleChecker+Time [2022-04-14 15:18:31,710 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 173 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 543 Invalid, 8 Unknown, 0 Unchecked, 33.9s Time] [2022-04-14 15:18:31,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-04-14 15:18:31,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 172. [2022-04-14 15:18:31,783 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:18:31,783 INFO L82 GeneralOperation]: Start isEquivalent. First operand 179 states. Second operand has 172 states, 94 states have (on average 1.2765957446808511) internal successors, (120), 101 states have internal predecessors, (120), 65 states have call successors, (65), 14 states have call predecessors, (65), 12 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2022-04-14 15:18:31,784 INFO L74 IsIncluded]: Start isIncluded. First operand 179 states. Second operand has 172 states, 94 states have (on average 1.2765957446808511) internal successors, (120), 101 states have internal predecessors, (120), 65 states have call successors, (65), 14 states have call predecessors, (65), 12 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2022-04-14 15:18:31,784 INFO L87 Difference]: Start difference. First operand 179 states. Second operand has 172 states, 94 states have (on average 1.2765957446808511) internal successors, (120), 101 states have internal predecessors, (120), 65 states have call successors, (65), 14 states have call predecessors, (65), 12 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2022-04-14 15:18:31,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:18:31,790 INFO L93 Difference]: Finished difference Result 179 states and 255 transitions. [2022-04-14 15:18:31,790 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 255 transitions. [2022-04-14 15:18:31,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:18:31,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:18:31,791 INFO L74 IsIncluded]: Start isIncluded. First operand has 172 states, 94 states have (on average 1.2765957446808511) internal successors, (120), 101 states have internal predecessors, (120), 65 states have call successors, (65), 14 states have call predecessors, (65), 12 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) Second operand 179 states. [2022-04-14 15:18:31,791 INFO L87 Difference]: Start difference. First operand has 172 states, 94 states have (on average 1.2765957446808511) internal successors, (120), 101 states have internal predecessors, (120), 65 states have call successors, (65), 14 states have call predecessors, (65), 12 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) Second operand 179 states. [2022-04-14 15:18:31,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:18:31,797 INFO L93 Difference]: Finished difference Result 179 states and 255 transitions. [2022-04-14 15:18:31,797 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 255 transitions. [2022-04-14 15:18:31,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:18:31,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:18:31,797 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:18:31,798 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:18:31,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 94 states have (on average 1.2765957446808511) internal successors, (120), 101 states have internal predecessors, (120), 65 states have call successors, (65), 14 states have call predecessors, (65), 12 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2022-04-14 15:18:31,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 242 transitions. [2022-04-14 15:18:31,803 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 242 transitions. Word has length 24 [2022-04-14 15:18:31,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:18:31,803 INFO L478 AbstractCegarLoop]: Abstraction has 172 states and 242 transitions. [2022-04-14 15:18:31,803 INFO L479 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-14 15:18:31,803 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 242 transitions. [2022-04-14 15:18:31,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-14 15:18:31,804 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:18:31,804 INFO L499 BasicCegarLoop]: 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-14 15:18:31,820 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-14 15:18:32,020 WARN L460 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-14 15:18:32,021 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:18:32,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:18:32,021 INFO L85 PathProgramCache]: Analyzing trace with hash -45171523, now seen corresponding path program 1 times [2022-04-14 15:18:32,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:18:32,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162388867] [2022-04-14 15:18:32,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:18:32,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:18:32,030 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:18:32,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1766488694] [2022-04-14 15:18:32,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:18:32,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:18:32,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:18:32,038 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 15:18:32,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-14 15:18:32,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:18:32,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-14 15:18:32,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:18:32,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:18:32,337 INFO L272 TraceCheckUtils]: 0: Hoare triple {3643#true} call ULTIMATE.init(); {3643#true} is VALID [2022-04-14 15:18:32,337 INFO L290 TraceCheckUtils]: 1: Hoare triple {3643#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; {3643#true} is VALID [2022-04-14 15:18:32,337 INFO L290 TraceCheckUtils]: 2: Hoare triple {3643#true} assume true; {3643#true} is VALID [2022-04-14 15:18:32,338 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3643#true} {3643#true} #102#return; {3643#true} is VALID [2022-04-14 15:18:32,338 INFO L272 TraceCheckUtils]: 4: Hoare triple {3643#true} call #t~ret7 := main(); {3643#true} is VALID [2022-04-14 15:18:32,338 INFO L290 TraceCheckUtils]: 5: Hoare triple {3643#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {3643#true} is VALID [2022-04-14 15:18:32,338 INFO L272 TraceCheckUtils]: 6: Hoare triple {3643#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {3643#true} is VALID [2022-04-14 15:18:32,338 INFO L290 TraceCheckUtils]: 7: Hoare triple {3643#true} ~cond := #in~cond; {3643#true} is VALID [2022-04-14 15:18:32,338 INFO L290 TraceCheckUtils]: 8: Hoare triple {3643#true} assume !(0 == ~cond); {3643#true} is VALID [2022-04-14 15:18:32,338 INFO L290 TraceCheckUtils]: 9: Hoare triple {3643#true} assume true; {3643#true} is VALID [2022-04-14 15:18:32,338 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3643#true} {3643#true} #82#return; {3643#true} is VALID [2022-04-14 15:18:32,339 INFO L290 TraceCheckUtils]: 11: Hoare triple {3643#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {3681#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-14 15:18:32,339 INFO L290 TraceCheckUtils]: 12: Hoare triple {3681#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3681#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-14 15:18:32,339 INFO L290 TraceCheckUtils]: 13: Hoare triple {3681#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !!(#t~post5 < 10);havoc #t~post5; {3681#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-14 15:18:32,340 INFO L290 TraceCheckUtils]: 14: Hoare triple {3681#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {3681#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-14 15:18:32,341 INFO L290 TraceCheckUtils]: 15: Hoare triple {3681#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3681#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-14 15:18:32,341 INFO L290 TraceCheckUtils]: 16: Hoare triple {3681#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !!(#t~post6 < 10);havoc #t~post6; {3681#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-14 15:18:32,341 INFO L272 TraceCheckUtils]: 17: Hoare triple {3681#(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)); {3643#true} is VALID [2022-04-14 15:18:32,341 INFO L290 TraceCheckUtils]: 18: Hoare triple {3643#true} ~cond := #in~cond; {3643#true} is VALID [2022-04-14 15:18:32,341 INFO L290 TraceCheckUtils]: 19: Hoare triple {3643#true} assume !(0 == ~cond); {3643#true} is VALID [2022-04-14 15:18:32,341 INFO L290 TraceCheckUtils]: 20: Hoare triple {3643#true} assume true; {3643#true} is VALID [2022-04-14 15:18:32,342 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3643#true} {3681#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #84#return; {3681#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-14 15:18:32,342 INFO L272 TraceCheckUtils]: 22: Hoare triple {3681#(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)); {3643#true} is VALID [2022-04-14 15:18:32,342 INFO L290 TraceCheckUtils]: 23: Hoare triple {3643#true} ~cond := #in~cond; {3643#true} is VALID [2022-04-14 15:18:32,342 INFO L290 TraceCheckUtils]: 24: Hoare triple {3643#true} assume !(0 == ~cond); {3643#true} is VALID [2022-04-14 15:18:32,342 INFO L290 TraceCheckUtils]: 25: Hoare triple {3643#true} assume true; {3643#true} is VALID [2022-04-14 15:18:32,342 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3643#true} {3681#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #86#return; {3681#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-14 15:18:32,343 INFO L272 TraceCheckUtils]: 27: Hoare triple {3681#(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)); {3730#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:18:32,344 INFO L290 TraceCheckUtils]: 28: Hoare triple {3730#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3734#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:18:32,344 INFO L290 TraceCheckUtils]: 29: Hoare triple {3734#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3644#false} is VALID [2022-04-14 15:18:32,344 INFO L290 TraceCheckUtils]: 30: Hoare triple {3644#false} assume !false; {3644#false} is VALID [2022-04-14 15:18:32,345 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-14 15:18:32,345 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 15:18:32,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:18:32,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162388867] [2022-04-14 15:18:32,346 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:18:32,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766488694] [2022-04-14 15:18:32,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1766488694] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 15:18:32,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 15:18:32,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 15:18:32,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740364658] [2022-04-14 15:18:32,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:18:32,347 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-14 15:18:32,347 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:18:32,347 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-14 15:18:32,381 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-14 15:18:32,382 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 15:18:32,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:18:32,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 15:18:32,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 15:18:32,383 INFO L87 Difference]: Start difference. First operand 172 states and 242 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-14 15:18:34,774 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 15:18:37,186 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 15:18:42,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:18:42,625 INFO L93 Difference]: Finished difference Result 178 states and 246 transitions. [2022-04-14 15:18:42,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 15:18:42,626 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-14 15:18:42,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:18:42,626 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-14 15:18:42,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-04-14 15:18:42,627 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-14 15:18:42,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-04-14 15:18:42,628 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 71 transitions. [2022-04-14 15:18:42,727 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-14 15:18:42,730 INFO L225 Difference]: With dead ends: 178 [2022-04-14 15:18:42,730 INFO L226 Difference]: Without dead ends: 152 [2022-04-14 15:18:42,730 INFO L912 BasicCegarLoop]: 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-14 15:18:42,731 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 6 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-04-14 15:18:42,731 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 154 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 2 Unknown, 0 Unchecked, 4.6s Time] [2022-04-14 15:18:42,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-04-14 15:18:42,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2022-04-14 15:18:42,801 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:18:42,802 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-14 15:18:42,802 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-14 15:18:42,803 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-14 15:18:42,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:18:42,807 INFO L93 Difference]: Finished difference Result 152 states and 216 transitions. [2022-04-14 15:18:42,807 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 216 transitions. [2022-04-14 15:18:42,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:18:42,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:18:42,813 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-14 15:18:42,813 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-14 15:18:42,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:18:42,818 INFO L93 Difference]: Finished difference Result 152 states and 216 transitions. [2022-04-14 15:18:42,818 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 216 transitions. [2022-04-14 15:18:42,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:18:42,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:18:42,818 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:18:42,818 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:18:42,819 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-14 15:18:42,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 216 transitions. [2022-04-14 15:18:42,822 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 216 transitions. Word has length 31 [2022-04-14 15:18:42,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:18:42,822 INFO L478 AbstractCegarLoop]: Abstraction has 152 states and 216 transitions. [2022-04-14 15:18:42,823 INFO L479 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-14 15:18:42,823 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 216 transitions. [2022-04-14 15:18:42,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-14 15:18:42,824 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:18:42,824 INFO L499 BasicCegarLoop]: 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-14 15:18:42,841 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-14 15:18:43,028 WARN L460 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-14 15:18:43,028 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:18:43,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:18:43,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1547125783, now seen corresponding path program 1 times [2022-04-14 15:18:43,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:18:43,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489339316] [2022-04-14 15:18:43,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:18:43,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:18:43,047 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:18:43,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2137357191] [2022-04-14 15:18:43,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:18:43,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:18:43,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:18:43,048 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 15:18:43,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-14 15:18:43,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:18:43,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-14 15:18:43,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:18:43,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:18:43,286 INFO L272 TraceCheckUtils]: 0: Hoare triple {4537#true} call ULTIMATE.init(); {4537#true} is VALID [2022-04-14 15:18:43,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {4537#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; {4537#true} is VALID [2022-04-14 15:18:43,287 INFO L290 TraceCheckUtils]: 2: Hoare triple {4537#true} assume true; {4537#true} is VALID [2022-04-14 15:18:43,287 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4537#true} {4537#true} #102#return; {4537#true} is VALID [2022-04-14 15:18:43,287 INFO L272 TraceCheckUtils]: 4: Hoare triple {4537#true} call #t~ret7 := main(); {4537#true} is VALID [2022-04-14 15:18:43,287 INFO L290 TraceCheckUtils]: 5: Hoare triple {4537#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {4537#true} is VALID [2022-04-14 15:18:43,287 INFO L272 TraceCheckUtils]: 6: Hoare triple {4537#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {4537#true} is VALID [2022-04-14 15:18:43,287 INFO L290 TraceCheckUtils]: 7: Hoare triple {4537#true} ~cond := #in~cond; {4537#true} is VALID [2022-04-14 15:18:43,287 INFO L290 TraceCheckUtils]: 8: Hoare triple {4537#true} assume !(0 == ~cond); {4537#true} is VALID [2022-04-14 15:18:43,287 INFO L290 TraceCheckUtils]: 9: Hoare triple {4537#true} assume true; {4537#true} is VALID [2022-04-14 15:18:43,287 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4537#true} {4537#true} #82#return; {4537#true} is VALID [2022-04-14 15:18:43,288 INFO L290 TraceCheckUtils]: 11: Hoare triple {4537#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {4575#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-14 15:18:43,288 INFO L290 TraceCheckUtils]: 12: Hoare triple {4575#(and (= main_~p~0 0) (= main_~h~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4575#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-14 15:18:43,289 INFO L290 TraceCheckUtils]: 13: Hoare triple {4575#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {4575#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-14 15:18:43,289 INFO L290 TraceCheckUtils]: 14: Hoare triple {4575#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {4575#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-14 15:18:43,289 INFO L290 TraceCheckUtils]: 15: Hoare triple {4575#(and (= main_~p~0 0) (= main_~h~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4575#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-14 15:18:43,290 INFO L290 TraceCheckUtils]: 16: Hoare triple {4575#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {4575#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-14 15:18:43,290 INFO L290 TraceCheckUtils]: 17: Hoare triple {4575#(and (= main_~p~0 0) (= main_~h~0 0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {4575#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-14 15:18:43,291 INFO L290 TraceCheckUtils]: 18: Hoare triple {4575#(and (= main_~p~0 0) (= main_~h~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4575#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-14 15:18:43,291 INFO L290 TraceCheckUtils]: 19: Hoare triple {4575#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(#t~post6 < 10);havoc #t~post6; {4575#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-14 15:18:43,291 INFO L272 TraceCheckUtils]: 20: Hoare triple {4575#(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)); {4537#true} is VALID [2022-04-14 15:18:43,291 INFO L290 TraceCheckUtils]: 21: Hoare triple {4537#true} ~cond := #in~cond; {4537#true} is VALID [2022-04-14 15:18:43,291 INFO L290 TraceCheckUtils]: 22: Hoare triple {4537#true} assume !(0 == ~cond); {4537#true} is VALID [2022-04-14 15:18:43,291 INFO L290 TraceCheckUtils]: 23: Hoare triple {4537#true} assume true; {4537#true} is VALID [2022-04-14 15:18:43,292 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {4537#true} {4575#(and (= main_~p~0 0) (= main_~h~0 0))} #84#return; {4575#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-14 15:18:43,292 INFO L272 TraceCheckUtils]: 25: Hoare triple {4575#(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)); {4537#true} is VALID [2022-04-14 15:18:43,292 INFO L290 TraceCheckUtils]: 26: Hoare triple {4537#true} ~cond := #in~cond; {4537#true} is VALID [2022-04-14 15:18:43,292 INFO L290 TraceCheckUtils]: 27: Hoare triple {4537#true} assume !(0 == ~cond); {4537#true} is VALID [2022-04-14 15:18:43,292 INFO L290 TraceCheckUtils]: 28: Hoare triple {4537#true} assume true; {4537#true} is VALID [2022-04-14 15:18:43,292 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {4537#true} {4575#(and (= main_~p~0 0) (= main_~h~0 0))} #86#return; {4575#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-14 15:18:43,293 INFO L272 TraceCheckUtils]: 30: Hoare triple {4575#(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)); {4633#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:18:43,294 INFO L290 TraceCheckUtils]: 31: Hoare triple {4633#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4637#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:18:43,294 INFO L290 TraceCheckUtils]: 32: Hoare triple {4637#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4538#false} is VALID [2022-04-14 15:18:43,294 INFO L290 TraceCheckUtils]: 33: Hoare triple {4538#false} assume !false; {4538#false} is VALID [2022-04-14 15:18:43,294 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-14 15:18:43,294 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 15:18:43,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:18:43,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489339316] [2022-04-14 15:18:43,294 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:18:43,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137357191] [2022-04-14 15:18:43,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137357191] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 15:18:43,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 15:18:43,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 15:18:43,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272919925] [2022-04-14 15:18:43,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:18:43,295 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-14 15:18:43,295 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:18:43,295 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-14 15:18:43,322 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-14 15:18:43,322 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 15:18:43,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:18:43,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 15:18:43,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 15:18:43,323 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-14 15:18:47,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:18:47,153 INFO L93 Difference]: Finished difference Result 182 states and 241 transitions. [2022-04-14 15:18:47,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 15:18:47,153 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-14 15:18:47,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:18:47,153 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-14 15:18:47,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-04-14 15:18:47,155 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-14 15:18:47,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-04-14 15:18:47,156 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 69 transitions. [2022-04-14 15:18:47,251 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:18:47,253 INFO L225 Difference]: With dead ends: 182 [2022-04-14 15:18:47,254 INFO L226 Difference]: Without dead ends: 177 [2022-04-14 15:18:47,254 INFO L912 BasicCegarLoop]: 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-14 15:18:47,254 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 8 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-14 15:18:47,254 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 156 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-14 15:18:47,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-04-14 15:18:47,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 170. [2022-04-14 15:18:47,316 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:18:47,316 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-14 15:18:47,316 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-14 15:18:47,317 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-14 15:18:47,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:18:47,321 INFO L93 Difference]: Finished difference Result 177 states and 228 transitions. [2022-04-14 15:18:47,321 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 228 transitions. [2022-04-14 15:18:47,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:18:47,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:18:47,322 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-14 15:18:47,322 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-14 15:18:47,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:18:47,327 INFO L93 Difference]: Finished difference Result 177 states and 228 transitions. [2022-04-14 15:18:47,327 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 228 transitions. [2022-04-14 15:18:47,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:18:47,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:18:47,327 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:18:47,327 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:18:47,329 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-14 15:18:47,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 219 transitions. [2022-04-14 15:18:47,333 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 219 transitions. Word has length 34 [2022-04-14 15:18:47,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:18:47,333 INFO L478 AbstractCegarLoop]: Abstraction has 170 states and 219 transitions. [2022-04-14 15:18:47,333 INFO L479 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-14 15:18:47,333 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 219 transitions. [2022-04-14 15:18:47,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-14 15:18:47,334 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:18:47,334 INFO L499 BasicCegarLoop]: 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-14 15:18:47,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-14 15:18:47,550 WARN L460 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-14 15:18:47,550 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:18:47,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:18:47,551 INFO L85 PathProgramCache]: Analyzing trace with hash 821435566, now seen corresponding path program 1 times [2022-04-14 15:18:47,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:18:47,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716474969] [2022-04-14 15:18:47,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:18:47,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:18:47,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:18:47,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 15:18:47,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:18:47,668 INFO L290 TraceCheckUtils]: 0: Hoare triple {5526#(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; {5516#(<= ~counter~0 0)} is VALID [2022-04-14 15:18:47,669 INFO L290 TraceCheckUtils]: 1: Hoare triple {5516#(<= ~counter~0 0)} assume true; {5516#(<= ~counter~0 0)} is VALID [2022-04-14 15:18:47,669 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5516#(<= ~counter~0 0)} {5511#true} #102#return; {5516#(<= ~counter~0 0)} is VALID [2022-04-14 15:18:47,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-14 15:18:47,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:18:47,674 INFO L290 TraceCheckUtils]: 0: Hoare triple {5511#true} ~cond := #in~cond; {5511#true} is VALID [2022-04-14 15:18:47,675 INFO L290 TraceCheckUtils]: 1: Hoare triple {5511#true} assume !(0 == ~cond); {5511#true} is VALID [2022-04-14 15:18:47,675 INFO L290 TraceCheckUtils]: 2: Hoare triple {5511#true} assume true; {5511#true} is VALID [2022-04-14 15:18:47,675 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5511#true} {5516#(<= ~counter~0 0)} #82#return; {5516#(<= ~counter~0 0)} is VALID [2022-04-14 15:18:47,675 INFO L272 TraceCheckUtils]: 0: Hoare triple {5511#true} call ULTIMATE.init(); {5526#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 15:18:47,676 INFO L290 TraceCheckUtils]: 1: Hoare triple {5526#(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; {5516#(<= ~counter~0 0)} is VALID [2022-04-14 15:18:47,676 INFO L290 TraceCheckUtils]: 2: Hoare triple {5516#(<= ~counter~0 0)} assume true; {5516#(<= ~counter~0 0)} is VALID [2022-04-14 15:18:47,676 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5516#(<= ~counter~0 0)} {5511#true} #102#return; {5516#(<= ~counter~0 0)} is VALID [2022-04-14 15:18:47,677 INFO L272 TraceCheckUtils]: 4: Hoare triple {5516#(<= ~counter~0 0)} call #t~ret7 := main(); {5516#(<= ~counter~0 0)} is VALID [2022-04-14 15:18:47,677 INFO L290 TraceCheckUtils]: 5: Hoare triple {5516#(<= ~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; {5516#(<= ~counter~0 0)} is VALID [2022-04-14 15:18:47,677 INFO L272 TraceCheckUtils]: 6: Hoare triple {5516#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {5511#true} is VALID [2022-04-14 15:18:47,677 INFO L290 TraceCheckUtils]: 7: Hoare triple {5511#true} ~cond := #in~cond; {5511#true} is VALID [2022-04-14 15:18:47,677 INFO L290 TraceCheckUtils]: 8: Hoare triple {5511#true} assume !(0 == ~cond); {5511#true} is VALID [2022-04-14 15:18:47,677 INFO L290 TraceCheckUtils]: 9: Hoare triple {5511#true} assume true; {5511#true} is VALID [2022-04-14 15:18:47,677 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5511#true} {5516#(<= ~counter~0 0)} #82#return; {5516#(<= ~counter~0 0)} is VALID [2022-04-14 15:18:47,678 INFO L290 TraceCheckUtils]: 11: Hoare triple {5516#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {5516#(<= ~counter~0 0)} is VALID [2022-04-14 15:18:47,678 INFO L290 TraceCheckUtils]: 12: Hoare triple {5516#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5521#(<= ~counter~0 1)} is VALID [2022-04-14 15:18:47,679 INFO L290 TraceCheckUtils]: 13: Hoare triple {5521#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {5521#(<= ~counter~0 1)} is VALID [2022-04-14 15:18:47,679 INFO L290 TraceCheckUtils]: 14: Hoare triple {5521#(<= ~counter~0 1)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5521#(<= ~counter~0 1)} is VALID [2022-04-14 15:18:47,679 INFO L290 TraceCheckUtils]: 15: Hoare triple {5521#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5522#(<= ~counter~0 2)} is VALID [2022-04-14 15:18:47,680 INFO L290 TraceCheckUtils]: 16: Hoare triple {5522#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {5522#(<= ~counter~0 2)} is VALID [2022-04-14 15:18:47,680 INFO L290 TraceCheckUtils]: 17: Hoare triple {5522#(<= ~counter~0 2)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5522#(<= ~counter~0 2)} is VALID [2022-04-14 15:18:47,680 INFO L290 TraceCheckUtils]: 18: Hoare triple {5522#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5523#(<= ~counter~0 3)} is VALID [2022-04-14 15:18:47,681 INFO L290 TraceCheckUtils]: 19: Hoare triple {5523#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {5523#(<= ~counter~0 3)} is VALID [2022-04-14 15:18:47,681 INFO L290 TraceCheckUtils]: 20: Hoare triple {5523#(<= ~counter~0 3)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5523#(<= ~counter~0 3)} is VALID [2022-04-14 15:18:47,681 INFO L290 TraceCheckUtils]: 21: Hoare triple {5523#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5524#(<= ~counter~0 4)} is VALID [2022-04-14 15:18:47,681 INFO L290 TraceCheckUtils]: 22: Hoare triple {5524#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {5524#(<= ~counter~0 4)} is VALID [2022-04-14 15:18:47,682 INFO L290 TraceCheckUtils]: 23: Hoare triple {5524#(<= ~counter~0 4)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5524#(<= ~counter~0 4)} is VALID [2022-04-14 15:18:47,682 INFO L290 TraceCheckUtils]: 24: Hoare triple {5524#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5525#(<= |main_#t~post5| 4)} is VALID [2022-04-14 15:18:47,682 INFO L290 TraceCheckUtils]: 25: Hoare triple {5525#(<= |main_#t~post5| 4)} assume !(#t~post5 < 10);havoc #t~post5; {5512#false} is VALID [2022-04-14 15:18:47,682 INFO L290 TraceCheckUtils]: 26: Hoare triple {5512#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5512#false} is VALID [2022-04-14 15:18:47,682 INFO L290 TraceCheckUtils]: 27: Hoare triple {5512#false} assume !!(#t~post6 < 10);havoc #t~post6; {5512#false} is VALID [2022-04-14 15:18:47,682 INFO L272 TraceCheckUtils]: 28: Hoare triple {5512#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {5512#false} is VALID [2022-04-14 15:18:47,683 INFO L290 TraceCheckUtils]: 29: Hoare triple {5512#false} ~cond := #in~cond; {5512#false} is VALID [2022-04-14 15:18:47,683 INFO L290 TraceCheckUtils]: 30: Hoare triple {5512#false} assume 0 == ~cond; {5512#false} is VALID [2022-04-14 15:18:47,683 INFO L290 TraceCheckUtils]: 31: Hoare triple {5512#false} assume !false; {5512#false} is VALID [2022-04-14 15:18:47,683 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-14 15:18:47,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:18:47,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716474969] [2022-04-14 15:18:47,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716474969] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 15:18:47,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748861094] [2022-04-14 15:18:47,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:18:47,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:18:47,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:18:47,684 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 15:18:47,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-14 15:18:47,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:18:47,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-14 15:18:47,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:18:47,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:18:47,917 INFO L272 TraceCheckUtils]: 0: Hoare triple {5511#true} call ULTIMATE.init(); {5511#true} is VALID [2022-04-14 15:18:47,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {5511#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; {5516#(<= ~counter~0 0)} is VALID [2022-04-14 15:18:47,918 INFO L290 TraceCheckUtils]: 2: Hoare triple {5516#(<= ~counter~0 0)} assume true; {5516#(<= ~counter~0 0)} is VALID [2022-04-14 15:18:47,920 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5516#(<= ~counter~0 0)} {5511#true} #102#return; {5516#(<= ~counter~0 0)} is VALID [2022-04-14 15:18:47,922 INFO L272 TraceCheckUtils]: 4: Hoare triple {5516#(<= ~counter~0 0)} call #t~ret7 := main(); {5516#(<= ~counter~0 0)} is VALID [2022-04-14 15:18:47,922 INFO L290 TraceCheckUtils]: 5: Hoare triple {5516#(<= ~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; {5516#(<= ~counter~0 0)} is VALID [2022-04-14 15:18:47,922 INFO L272 TraceCheckUtils]: 6: Hoare triple {5516#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {5516#(<= ~counter~0 0)} is VALID [2022-04-14 15:18:47,923 INFO L290 TraceCheckUtils]: 7: Hoare triple {5516#(<= ~counter~0 0)} ~cond := #in~cond; {5516#(<= ~counter~0 0)} is VALID [2022-04-14 15:18:47,923 INFO L290 TraceCheckUtils]: 8: Hoare triple {5516#(<= ~counter~0 0)} assume !(0 == ~cond); {5516#(<= ~counter~0 0)} is VALID [2022-04-14 15:18:47,923 INFO L290 TraceCheckUtils]: 9: Hoare triple {5516#(<= ~counter~0 0)} assume true; {5516#(<= ~counter~0 0)} is VALID [2022-04-14 15:18:47,924 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5516#(<= ~counter~0 0)} {5516#(<= ~counter~0 0)} #82#return; {5516#(<= ~counter~0 0)} is VALID [2022-04-14 15:18:47,924 INFO L290 TraceCheckUtils]: 11: Hoare triple {5516#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {5516#(<= ~counter~0 0)} is VALID [2022-04-14 15:18:47,924 INFO L290 TraceCheckUtils]: 12: Hoare triple {5516#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5521#(<= ~counter~0 1)} is VALID [2022-04-14 15:18:47,925 INFO L290 TraceCheckUtils]: 13: Hoare triple {5521#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {5521#(<= ~counter~0 1)} is VALID [2022-04-14 15:18:47,925 INFO L290 TraceCheckUtils]: 14: Hoare triple {5521#(<= ~counter~0 1)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5521#(<= ~counter~0 1)} is VALID [2022-04-14 15:18:47,925 INFO L290 TraceCheckUtils]: 15: Hoare triple {5521#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5522#(<= ~counter~0 2)} is VALID [2022-04-14 15:18:47,926 INFO L290 TraceCheckUtils]: 16: Hoare triple {5522#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {5522#(<= ~counter~0 2)} is VALID [2022-04-14 15:18:47,926 INFO L290 TraceCheckUtils]: 17: Hoare triple {5522#(<= ~counter~0 2)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5522#(<= ~counter~0 2)} is VALID [2022-04-14 15:18:47,926 INFO L290 TraceCheckUtils]: 18: Hoare triple {5522#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5523#(<= ~counter~0 3)} is VALID [2022-04-14 15:18:47,927 INFO L290 TraceCheckUtils]: 19: Hoare triple {5523#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {5523#(<= ~counter~0 3)} is VALID [2022-04-14 15:18:47,927 INFO L290 TraceCheckUtils]: 20: Hoare triple {5523#(<= ~counter~0 3)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5523#(<= ~counter~0 3)} is VALID [2022-04-14 15:18:47,927 INFO L290 TraceCheckUtils]: 21: Hoare triple {5523#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5524#(<= ~counter~0 4)} is VALID [2022-04-14 15:18:47,928 INFO L290 TraceCheckUtils]: 22: Hoare triple {5524#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {5524#(<= ~counter~0 4)} is VALID [2022-04-14 15:18:47,928 INFO L290 TraceCheckUtils]: 23: Hoare triple {5524#(<= ~counter~0 4)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5524#(<= ~counter~0 4)} is VALID [2022-04-14 15:18:47,928 INFO L290 TraceCheckUtils]: 24: Hoare triple {5524#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5525#(<= |main_#t~post5| 4)} is VALID [2022-04-14 15:18:47,929 INFO L290 TraceCheckUtils]: 25: Hoare triple {5525#(<= |main_#t~post5| 4)} assume !(#t~post5 < 10);havoc #t~post5; {5512#false} is VALID [2022-04-14 15:18:47,929 INFO L290 TraceCheckUtils]: 26: Hoare triple {5512#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5512#false} is VALID [2022-04-14 15:18:47,929 INFO L290 TraceCheckUtils]: 27: Hoare triple {5512#false} assume !!(#t~post6 < 10);havoc #t~post6; {5512#false} is VALID [2022-04-14 15:18:47,929 INFO L272 TraceCheckUtils]: 28: Hoare triple {5512#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {5512#false} is VALID [2022-04-14 15:18:47,929 INFO L290 TraceCheckUtils]: 29: Hoare triple {5512#false} ~cond := #in~cond; {5512#false} is VALID [2022-04-14 15:18:47,929 INFO L290 TraceCheckUtils]: 30: Hoare triple {5512#false} assume 0 == ~cond; {5512#false} is VALID [2022-04-14 15:18:47,929 INFO L290 TraceCheckUtils]: 31: Hoare triple {5512#false} assume !false; {5512#false} is VALID [2022-04-14 15:18:47,929 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-14 15:18:47,929 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:18:48,147 INFO L290 TraceCheckUtils]: 31: Hoare triple {5512#false} assume !false; {5512#false} is VALID [2022-04-14 15:18:48,147 INFO L290 TraceCheckUtils]: 30: Hoare triple {5512#false} assume 0 == ~cond; {5512#false} is VALID [2022-04-14 15:18:48,147 INFO L290 TraceCheckUtils]: 29: Hoare triple {5512#false} ~cond := #in~cond; {5512#false} is VALID [2022-04-14 15:18:48,147 INFO L272 TraceCheckUtils]: 28: Hoare triple {5512#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {5512#false} is VALID [2022-04-14 15:18:48,147 INFO L290 TraceCheckUtils]: 27: Hoare triple {5512#false} assume !!(#t~post6 < 10);havoc #t~post6; {5512#false} is VALID [2022-04-14 15:18:48,147 INFO L290 TraceCheckUtils]: 26: Hoare triple {5512#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5512#false} is VALID [2022-04-14 15:18:48,147 INFO L290 TraceCheckUtils]: 25: Hoare triple {5641#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {5512#false} is VALID [2022-04-14 15:18:48,148 INFO L290 TraceCheckUtils]: 24: Hoare triple {5645#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5641#(< |main_#t~post5| 10)} is VALID [2022-04-14 15:18:48,148 INFO L290 TraceCheckUtils]: 23: Hoare triple {5645#(< ~counter~0 10)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5645#(< ~counter~0 10)} is VALID [2022-04-14 15:18:48,148 INFO L290 TraceCheckUtils]: 22: Hoare triple {5645#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {5645#(< ~counter~0 10)} is VALID [2022-04-14 15:18:48,149 INFO L290 TraceCheckUtils]: 21: Hoare triple {5655#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5645#(< ~counter~0 10)} is VALID [2022-04-14 15:18:48,149 INFO L290 TraceCheckUtils]: 20: Hoare triple {5655#(< ~counter~0 9)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5655#(< ~counter~0 9)} is VALID [2022-04-14 15:18:48,149 INFO L290 TraceCheckUtils]: 19: Hoare triple {5655#(< ~counter~0 9)} assume !!(#t~post5 < 10);havoc #t~post5; {5655#(< ~counter~0 9)} is VALID [2022-04-14 15:18:48,150 INFO L290 TraceCheckUtils]: 18: Hoare triple {5665#(< ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5655#(< ~counter~0 9)} is VALID [2022-04-14 15:18:48,150 INFO L290 TraceCheckUtils]: 17: Hoare triple {5665#(< ~counter~0 8)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5665#(< ~counter~0 8)} is VALID [2022-04-14 15:18:48,150 INFO L290 TraceCheckUtils]: 16: Hoare triple {5665#(< ~counter~0 8)} assume !!(#t~post5 < 10);havoc #t~post5; {5665#(< ~counter~0 8)} is VALID [2022-04-14 15:18:48,151 INFO L290 TraceCheckUtils]: 15: Hoare triple {5675#(< ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5665#(< ~counter~0 8)} is VALID [2022-04-14 15:18:48,151 INFO L290 TraceCheckUtils]: 14: Hoare triple {5675#(< ~counter~0 7)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5675#(< ~counter~0 7)} is VALID [2022-04-14 15:18:48,151 INFO L290 TraceCheckUtils]: 13: Hoare triple {5675#(< ~counter~0 7)} assume !!(#t~post5 < 10);havoc #t~post5; {5675#(< ~counter~0 7)} is VALID [2022-04-14 15:18:48,152 INFO L290 TraceCheckUtils]: 12: Hoare triple {5685#(< ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5675#(< ~counter~0 7)} is VALID [2022-04-14 15:18:48,152 INFO L290 TraceCheckUtils]: 11: Hoare triple {5685#(< ~counter~0 6)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {5685#(< ~counter~0 6)} is VALID [2022-04-14 15:18:48,152 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5511#true} {5685#(< ~counter~0 6)} #82#return; {5685#(< ~counter~0 6)} is VALID [2022-04-14 15:18:48,152 INFO L290 TraceCheckUtils]: 9: Hoare triple {5511#true} assume true; {5511#true} is VALID [2022-04-14 15:18:48,152 INFO L290 TraceCheckUtils]: 8: Hoare triple {5511#true} assume !(0 == ~cond); {5511#true} is VALID [2022-04-14 15:18:48,152 INFO L290 TraceCheckUtils]: 7: Hoare triple {5511#true} ~cond := #in~cond; {5511#true} is VALID [2022-04-14 15:18:48,153 INFO L272 TraceCheckUtils]: 6: Hoare triple {5685#(< ~counter~0 6)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {5511#true} is VALID [2022-04-14 15:18:48,153 INFO L290 TraceCheckUtils]: 5: Hoare triple {5685#(< ~counter~0 6)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {5685#(< ~counter~0 6)} is VALID [2022-04-14 15:18:48,153 INFO L272 TraceCheckUtils]: 4: Hoare triple {5685#(< ~counter~0 6)} call #t~ret7 := main(); {5685#(< ~counter~0 6)} is VALID [2022-04-14 15:18:48,153 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5685#(< ~counter~0 6)} {5511#true} #102#return; {5685#(< ~counter~0 6)} is VALID [2022-04-14 15:18:48,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {5685#(< ~counter~0 6)} assume true; {5685#(< ~counter~0 6)} is VALID [2022-04-14 15:18:48,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {5511#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; {5685#(< ~counter~0 6)} is VALID [2022-04-14 15:18:48,154 INFO L272 TraceCheckUtils]: 0: Hoare triple {5511#true} call ULTIMATE.init(); {5511#true} is VALID [2022-04-14 15:18:48,154 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-14 15:18:48,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [748861094] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 15:18:48,154 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-14 15:18:48,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 15 [2022-04-14 15:18:48,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171724577] [2022-04-14 15:18:48,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-14 15:18:48,155 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-14 15:18:48,155 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:18:48,155 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-14 15:18:48,195 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-14 15:18:48,195 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-14 15:18:48,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:18:48,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-14 15:18:48,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2022-04-14 15:18:48,196 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-14 15:18:50,524 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 15:18:54,165 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 15:18:58,526 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 15:19:02,925 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-14 15:19:15,199 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 15:19:17,875 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-14 15:19:20,369 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 15:19:22,683 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-14 15:19:26,231 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 15:19:31,330 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 15:19:34,089 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.76s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 15:19:36,848 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.76s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 15:19:38,865 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-14 15:19:40,870 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-14 15:19:44,482 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-14 15:19:48,139 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-14 15:19:50,236 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-14 15:19:55,984 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-14 15:19:58,244 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-14 15:20:01,428 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-14 15:20:08,301 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 15:20:10,377 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 15:20:13,315 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 15:20:20,058 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-14 15:20:22,069 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-14 15:20:22,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:20:22,401 INFO L93 Difference]: Finished difference Result 381 states and 496 transitions. [2022-04-14 15:20:22,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-14 15:20:22,402 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-14 15:20:22,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:20:22,402 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-14 15:20:22,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 299 transitions. [2022-04-14 15:20:22,409 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-14 15:20:22,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 299 transitions. [2022-04-14 15:20:22,411 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 299 transitions. [2022-04-14 15:20:22,680 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 299 edges. 299 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:20:22,687 INFO L225 Difference]: With dead ends: 381 [2022-04-14 15:20:22,687 INFO L226 Difference]: Without dead ends: 341 [2022-04-14 15:20:22,688 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=716, Unknown=0, NotChecked=0, Total=992 [2022-04-14 15:20:22,688 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 268 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 224 mSolverCounterUnsat, 20 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 74.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 224 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 20 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 75.0s IncrementalHoareTripleChecker+Time [2022-04-14 15:20:22,688 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [317 Valid, 152 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [224 Valid, 496 Invalid, 20 Unknown, 0 Unchecked, 75.0s Time] [2022-04-14 15:20:22,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2022-04-14 15:20:22,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 328. [2022-04-14 15:20:22,841 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:20:22,842 INFO L82 GeneralOperation]: Start isEquivalent. First operand 341 states. Second operand has 328 states, 185 states have (on average 1.1837837837837837) internal successors, (219), 195 states have internal predecessors, (219), 109 states have call successors, (109), 34 states have call predecessors, (109), 33 states have return successors, (102), 98 states have call predecessors, (102), 102 states have call successors, (102) [2022-04-14 15:20:22,842 INFO L74 IsIncluded]: Start isIncluded. First operand 341 states. Second operand has 328 states, 185 states have (on average 1.1837837837837837) internal successors, (219), 195 states have internal predecessors, (219), 109 states have call successors, (109), 34 states have call predecessors, (109), 33 states have return successors, (102), 98 states have call predecessors, (102), 102 states have call successors, (102) [2022-04-14 15:20:22,843 INFO L87 Difference]: Start difference. First operand 341 states. Second operand has 328 states, 185 states have (on average 1.1837837837837837) internal successors, (219), 195 states have internal predecessors, (219), 109 states have call successors, (109), 34 states have call predecessors, (109), 33 states have return successors, (102), 98 states have call predecessors, (102), 102 states have call successors, (102) [2022-04-14 15:20:22,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:20:22,850 INFO L93 Difference]: Finished difference Result 341 states and 437 transitions. [2022-04-14 15:20:22,850 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 437 transitions. [2022-04-14 15:20:22,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:20:22,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:20:22,851 INFO L74 IsIncluded]: Start isIncluded. First operand has 328 states, 185 states have (on average 1.1837837837837837) internal successors, (219), 195 states have internal predecessors, (219), 109 states have call successors, (109), 34 states have call predecessors, (109), 33 states have return successors, (102), 98 states have call predecessors, (102), 102 states have call successors, (102) Second operand 341 states. [2022-04-14 15:20:22,852 INFO L87 Difference]: Start difference. First operand has 328 states, 185 states have (on average 1.1837837837837837) internal successors, (219), 195 states have internal predecessors, (219), 109 states have call successors, (109), 34 states have call predecessors, (109), 33 states have return successors, (102), 98 states have call predecessors, (102), 102 states have call successors, (102) Second operand 341 states. [2022-04-14 15:20:22,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:20:22,859 INFO L93 Difference]: Finished difference Result 341 states and 437 transitions. [2022-04-14 15:20:22,859 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 437 transitions. [2022-04-14 15:20:22,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:20:22,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:20:22,860 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:20:22,860 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:20:22,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 185 states have (on average 1.1837837837837837) internal successors, (219), 195 states have internal predecessors, (219), 109 states have call successors, (109), 34 states have call predecessors, (109), 33 states have return successors, (102), 98 states have call predecessors, (102), 102 states have call successors, (102) [2022-04-14 15:20:22,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 430 transitions. [2022-04-14 15:20:22,867 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 430 transitions. Word has length 32 [2022-04-14 15:20:22,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:20:22,867 INFO L478 AbstractCegarLoop]: Abstraction has 328 states and 430 transitions. [2022-04-14 15:20:22,868 INFO L479 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-14 15:20:22,868 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 430 transitions. [2022-04-14 15:20:22,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-14 15:20:22,869 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:20:22,869 INFO L499 BasicCegarLoop]: 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-14 15:20:22,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-14 15:20:23,085 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-14 15:20:23,085 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:20:23,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:20:23,086 INFO L85 PathProgramCache]: Analyzing trace with hash -271152338, now seen corresponding path program 2 times [2022-04-14 15:20:23,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:20:23,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967585313] [2022-04-14 15:20:23,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:20:23,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:20:23,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:20:23,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 15:20:23,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:20:23,165 INFO L290 TraceCheckUtils]: 0: Hoare triple {7489#(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; {7477#true} is VALID [2022-04-14 15:20:23,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {7477#true} assume true; {7477#true} is VALID [2022-04-14 15:20:23,165 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7477#true} {7477#true} #102#return; {7477#true} is VALID [2022-04-14 15:20:23,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-14 15:20:23,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:20:23,168 INFO L290 TraceCheckUtils]: 0: Hoare triple {7477#true} ~cond := #in~cond; {7477#true} is VALID [2022-04-14 15:20:23,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {7477#true} assume !(0 == ~cond); {7477#true} is VALID [2022-04-14 15:20:23,169 INFO L290 TraceCheckUtils]: 2: Hoare triple {7477#true} assume true; {7477#true} is VALID [2022-04-14 15:20:23,169 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7477#true} {7477#true} #82#return; {7477#true} is VALID [2022-04-14 15:20:23,169 INFO L272 TraceCheckUtils]: 0: Hoare triple {7477#true} call ULTIMATE.init(); {7489#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 15:20:23,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {7489#(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; {7477#true} is VALID [2022-04-14 15:20:23,169 INFO L290 TraceCheckUtils]: 2: Hoare triple {7477#true} assume true; {7477#true} is VALID [2022-04-14 15:20:23,169 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7477#true} {7477#true} #102#return; {7477#true} is VALID [2022-04-14 15:20:23,169 INFO L272 TraceCheckUtils]: 4: Hoare triple {7477#true} call #t~ret7 := main(); {7477#true} is VALID [2022-04-14 15:20:23,169 INFO L290 TraceCheckUtils]: 5: Hoare triple {7477#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {7477#true} is VALID [2022-04-14 15:20:23,170 INFO L272 TraceCheckUtils]: 6: Hoare triple {7477#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {7477#true} is VALID [2022-04-14 15:20:23,170 INFO L290 TraceCheckUtils]: 7: Hoare triple {7477#true} ~cond := #in~cond; {7477#true} is VALID [2022-04-14 15:20:23,170 INFO L290 TraceCheckUtils]: 8: Hoare triple {7477#true} assume !(0 == ~cond); {7477#true} is VALID [2022-04-14 15:20:23,170 INFO L290 TraceCheckUtils]: 9: Hoare triple {7477#true} assume true; {7477#true} is VALID [2022-04-14 15:20:23,170 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7477#true} {7477#true} #82#return; {7477#true} is VALID [2022-04-14 15:20:23,170 INFO L290 TraceCheckUtils]: 11: Hoare triple {7477#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {7477#true} is VALID [2022-04-14 15:20:23,170 INFO L290 TraceCheckUtils]: 12: Hoare triple {7477#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7477#true} is VALID [2022-04-14 15:20:23,170 INFO L290 TraceCheckUtils]: 13: Hoare triple {7477#true} assume !!(#t~post5 < 10);havoc #t~post5; {7477#true} is VALID [2022-04-14 15:20:23,170 INFO L290 TraceCheckUtils]: 14: Hoare triple {7477#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7477#true} is VALID [2022-04-14 15:20:23,170 INFO L290 TraceCheckUtils]: 15: Hoare triple {7477#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7477#true} is VALID [2022-04-14 15:20:23,170 INFO L290 TraceCheckUtils]: 16: Hoare triple {7477#true} assume !!(#t~post5 < 10);havoc #t~post5; {7477#true} is VALID [2022-04-14 15:20:23,170 INFO L290 TraceCheckUtils]: 17: Hoare triple {7477#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7477#true} is VALID [2022-04-14 15:20:23,170 INFO L290 TraceCheckUtils]: 18: Hoare triple {7477#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7477#true} is VALID [2022-04-14 15:20:23,170 INFO L290 TraceCheckUtils]: 19: Hoare triple {7477#true} assume !!(#t~post5 < 10);havoc #t~post5; {7477#true} is VALID [2022-04-14 15:20:23,170 INFO L290 TraceCheckUtils]: 20: Hoare triple {7477#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7477#true} is VALID [2022-04-14 15:20:23,170 INFO L290 TraceCheckUtils]: 21: Hoare triple {7477#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7477#true} is VALID [2022-04-14 15:20:23,170 INFO L290 TraceCheckUtils]: 22: Hoare triple {7477#true} assume !!(#t~post5 < 10);havoc #t~post5; {7477#true} is VALID [2022-04-14 15:20:23,170 INFO L290 TraceCheckUtils]: 23: Hoare triple {7477#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7477#true} is VALID [2022-04-14 15:20:23,170 INFO L290 TraceCheckUtils]: 24: Hoare triple {7477#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7477#true} is VALID [2022-04-14 15:20:23,171 INFO L290 TraceCheckUtils]: 25: Hoare triple {7477#true} assume !!(#t~post5 < 10);havoc #t~post5; {7477#true} is VALID [2022-04-14 15:20:23,171 INFO L290 TraceCheckUtils]: 26: Hoare triple {7477#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7477#true} is VALID [2022-04-14 15:20:23,171 INFO L290 TraceCheckUtils]: 27: Hoare triple {7477#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7477#true} is VALID [2022-04-14 15:20:23,171 INFO L290 TraceCheckUtils]: 28: Hoare triple {7477#true} assume !!(#t~post5 < 10);havoc #t~post5; {7477#true} is VALID [2022-04-14 15:20:23,171 INFO L290 TraceCheckUtils]: 29: Hoare triple {7477#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7477#true} is VALID [2022-04-14 15:20:23,171 INFO L290 TraceCheckUtils]: 30: Hoare triple {7477#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7477#true} is VALID [2022-04-14 15:20:23,171 INFO L290 TraceCheckUtils]: 31: Hoare triple {7477#true} assume !!(#t~post5 < 10);havoc #t~post5; {7477#true} is VALID [2022-04-14 15:20:23,171 INFO L290 TraceCheckUtils]: 32: Hoare triple {7477#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7477#true} is VALID [2022-04-14 15:20:23,171 INFO L290 TraceCheckUtils]: 33: Hoare triple {7477#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7477#true} is VALID [2022-04-14 15:20:23,171 INFO L290 TraceCheckUtils]: 34: Hoare triple {7477#true} assume !!(#t~post5 < 10);havoc #t~post5; {7477#true} is VALID [2022-04-14 15:20:23,171 INFO L290 TraceCheckUtils]: 35: Hoare triple {7477#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7477#true} is VALID [2022-04-14 15:20:23,171 INFO L290 TraceCheckUtils]: 36: Hoare triple {7477#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7477#true} is VALID [2022-04-14 15:20:23,171 INFO L290 TraceCheckUtils]: 37: Hoare triple {7477#true} assume !!(#t~post5 < 10);havoc #t~post5; {7477#true} is VALID [2022-04-14 15:20:23,171 INFO L290 TraceCheckUtils]: 38: Hoare triple {7477#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7477#true} is VALID [2022-04-14 15:20:23,171 INFO L290 TraceCheckUtils]: 39: Hoare triple {7477#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7477#true} is VALID [2022-04-14 15:20:23,171 INFO L290 TraceCheckUtils]: 40: Hoare triple {7477#true} assume !!(#t~post5 < 10);havoc #t~post5; {7477#true} is VALID [2022-04-14 15:20:23,171 INFO L290 TraceCheckUtils]: 41: Hoare triple {7477#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7477#true} is VALID [2022-04-14 15:20:23,172 INFO L290 TraceCheckUtils]: 42: Hoare triple {7477#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7486#(<= (+ |main_#t~post5| 1) ~counter~0)} is VALID [2022-04-14 15:20:23,172 INFO L290 TraceCheckUtils]: 43: Hoare triple {7486#(<= (+ |main_#t~post5| 1) ~counter~0)} assume !(#t~post5 < 10);havoc #t~post5; {7487#(<= 11 ~counter~0)} is VALID [2022-04-14 15:20:23,173 INFO L290 TraceCheckUtils]: 44: Hoare triple {7487#(<= 11 ~counter~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7488#(<= 11 |main_#t~post6|)} is VALID [2022-04-14 15:20:23,173 INFO L290 TraceCheckUtils]: 45: Hoare triple {7488#(<= 11 |main_#t~post6|)} assume !!(#t~post6 < 10);havoc #t~post6; {7478#false} is VALID [2022-04-14 15:20:23,173 INFO L272 TraceCheckUtils]: 46: Hoare triple {7478#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {7478#false} is VALID [2022-04-14 15:20:23,173 INFO L290 TraceCheckUtils]: 47: Hoare triple {7478#false} ~cond := #in~cond; {7478#false} is VALID [2022-04-14 15:20:23,173 INFO L290 TraceCheckUtils]: 48: Hoare triple {7478#false} assume 0 == ~cond; {7478#false} is VALID [2022-04-14 15:20:23,173 INFO L290 TraceCheckUtils]: 49: Hoare triple {7478#false} assume !false; {7478#false} is VALID [2022-04-14 15:20:23,173 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-14 15:20:23,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:20:23,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967585313] [2022-04-14 15:20:23,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967585313] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 15:20:23,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 15:20:23,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-14 15:20:23,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680612429] [2022-04-14 15:20:23,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:20:23,175 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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 50 [2022-04-14 15:20:23,175 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:20:23,175 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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-14 15:20:23,189 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-14 15:20:23,190 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 15:20:23,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:20:23,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 15:20:23,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-14 15:20:23,190 INFO L87 Difference]: Start difference. First operand 328 states and 430 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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-14 15:20:29,397 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-14 15:20:31,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:20:31,973 INFO L93 Difference]: Finished difference Result 365 states and 479 transitions. [2022-04-14 15:20:31,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 15:20:31,973 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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 50 [2022-04-14 15:20:31,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:20:31,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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-14 15:20:31,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2022-04-14 15:20:31,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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-14 15:20:31,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2022-04-14 15:20:31,975 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 78 transitions. [2022-04-14 15:20:32,048 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-14 15:20:32,054 INFO L225 Difference]: With dead ends: 365 [2022-04-14 15:20:32,054 INFO L226 Difference]: Without dead ends: 325 [2022-04-14 15:20:32,055 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-14 15:20:32,055 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 10 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 12 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-04-14 15:20:32,055 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 106 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 101 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2022-04-14 15:20:32,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2022-04-14 15:20:32,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 320. [2022-04-14 15:20:32,217 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:20:32,218 INFO L82 GeneralOperation]: Start isEquivalent. First operand 325 states. Second operand has 320 states, 178 states have (on average 1.1797752808988764) internal successors, (210), 187 states have internal predecessors, (210), 108 states have call successors, (108), 34 states have call predecessors, (108), 33 states have return successors, (101), 98 states have call predecessors, (101), 101 states have call successors, (101) [2022-04-14 15:20:32,218 INFO L74 IsIncluded]: Start isIncluded. First operand 325 states. Second operand has 320 states, 178 states have (on average 1.1797752808988764) internal successors, (210), 187 states have internal predecessors, (210), 108 states have call successors, (108), 34 states have call predecessors, (108), 33 states have return successors, (101), 98 states have call predecessors, (101), 101 states have call successors, (101) [2022-04-14 15:20:32,219 INFO L87 Difference]: Start difference. First operand 325 states. Second operand has 320 states, 178 states have (on average 1.1797752808988764) internal successors, (210), 187 states have internal predecessors, (210), 108 states have call successors, (108), 34 states have call predecessors, (108), 33 states have return successors, (101), 98 states have call predecessors, (101), 101 states have call successors, (101) [2022-04-14 15:20:32,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:20:32,226 INFO L93 Difference]: Finished difference Result 325 states and 425 transitions. [2022-04-14 15:20:32,226 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 425 transitions. [2022-04-14 15:20:32,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:20:32,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:20:32,228 INFO L74 IsIncluded]: Start isIncluded. First operand has 320 states, 178 states have (on average 1.1797752808988764) internal successors, (210), 187 states have internal predecessors, (210), 108 states have call successors, (108), 34 states have call predecessors, (108), 33 states have return successors, (101), 98 states have call predecessors, (101), 101 states have call successors, (101) Second operand 325 states. [2022-04-14 15:20:32,228 INFO L87 Difference]: Start difference. First operand has 320 states, 178 states have (on average 1.1797752808988764) internal successors, (210), 187 states have internal predecessors, (210), 108 states have call successors, (108), 34 states have call predecessors, (108), 33 states have return successors, (101), 98 states have call predecessors, (101), 101 states have call successors, (101) Second operand 325 states. [2022-04-14 15:20:32,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:20:32,235 INFO L93 Difference]: Finished difference Result 325 states and 425 transitions. [2022-04-14 15:20:32,235 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 425 transitions. [2022-04-14 15:20:32,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:20:32,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:20:32,237 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:20:32,237 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:20:32,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 178 states have (on average 1.1797752808988764) internal successors, (210), 187 states have internal predecessors, (210), 108 states have call successors, (108), 34 states have call predecessors, (108), 33 states have return successors, (101), 98 states have call predecessors, (101), 101 states have call successors, (101) [2022-04-14 15:20:32,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 419 transitions. [2022-04-14 15:20:32,247 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 419 transitions. Word has length 50 [2022-04-14 15:20:32,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:20:32,247 INFO L478 AbstractCegarLoop]: Abstraction has 320 states and 419 transitions. [2022-04-14 15:20:32,248 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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-14 15:20:32,248 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 419 transitions. [2022-04-14 15:20:32,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-14 15:20:32,249 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:20:32,249 INFO L499 BasicCegarLoop]: 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-14 15:20:32,249 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-14 15:20:32,249 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:20:32,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:20:32,250 INFO L85 PathProgramCache]: Analyzing trace with hash 109392637, now seen corresponding path program 1 times [2022-04-14 15:20:32,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:20:32,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652301306] [2022-04-14 15:20:32,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:20:32,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:20:32,266 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:20:32,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [66520253] [2022-04-14 15:20:32,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:20:32,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:20:32,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:20:32,267 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-14 15:20:32,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process