/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_unwindbound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 13:02:22,178 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 13:02:22,179 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 13:02:22,202 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 13:02:22,203 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 13:02:22,204 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 13:02:22,206 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 13:02:22,210 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 13:02:22,211 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 13:02:22,214 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 13:02:22,215 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 13:02:22,216 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 13:02:22,216 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 13:02:22,218 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 13:02:22,218 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 13:02:22,219 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 13:02:22,220 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 13:02:22,220 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 13:02:22,223 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 13:02:22,231 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 13:02:22,232 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 13:02:22,248 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 13:02:22,248 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 13:02:22,249 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 13:02:22,249 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 13:02:22,251 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 13:02:22,251 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 13:02:22,251 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 13:02:22,252 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 13:02:22,252 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 13:02:22,252 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 13:02:22,253 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 13:02:22,253 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 13:02:22,254 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 13:02:22,254 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 13:02:22,255 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 13:02:22,255 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 13:02:22,255 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 13:02:22,255 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 13:02:22,256 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 13:02:22,256 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 13:02:22,261 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 13:02:22,262 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-07 13:02:22,289 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 13:02:22,290 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 13:02:22,290 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-07 13:02:22,290 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-07 13:02:22,291 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 13:02:22,291 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 13:02:22,291 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 13:02:22,291 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 13:02:22,291 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 13:02:22,292 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 13:02:22,292 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 13:02:22,292 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 13:02:22,293 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 13:02:22,293 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 13:02:22,293 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 13:02:22,293 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 13:02:22,293 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 13:02:22,293 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 13:02:22,294 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 13:02:22,294 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 13:02:22,298 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 13:02:22,300 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 13:02:22,300 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 13:02:22,300 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 13:02:22,300 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 13:02:22,300 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 13:02:22,300 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 13:02:22,300 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 13:02:22,300 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 13:02:22,301 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 13:02:22,301 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-07 13:02:22,301 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-07 13:02:22,301 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 13:02:22,301 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-07 13:02:22,494 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 13:02:22,508 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 13:02:22,509 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 13:02:22,510 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 13:02:22,510 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 13:02:22,511 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound5.c [2022-04-07 13:02:22,568 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7673914c/5807261650794d19ac1a7c512a06f702/FLAG6526ef343 [2022-04-07 13:02:22,891 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 13:02:22,891 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound5.c [2022-04-07 13:02:22,898 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7673914c/5807261650794d19ac1a7c512a06f702/FLAG6526ef343 [2022-04-07 13:02:22,906 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7673914c/5807261650794d19ac1a7c512a06f702 [2022-04-07 13:02:22,908 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 13:02:22,909 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-07 13:02:22,923 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 13:02:22,924 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 13:02:22,926 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 13:02:22,926 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 01:02:22" (1/1) ... [2022-04-07 13:02:22,927 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2884d328 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:02:22, skipping insertion in model container [2022-04-07 13:02:22,927 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 01:02:22" (1/1) ... [2022-04-07 13:02:22,931 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 13:02:22,942 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 13:02:23,052 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_unwindbound5.c[525,538] [2022-04-07 13:02:23,078 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 13:02:23,083 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 13:02:23,092 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_unwindbound5.c[525,538] [2022-04-07 13:02:23,107 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 13:02:23,116 INFO L208 MainTranslator]: Completed translation [2022-04-07 13:02:23,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:02:23 WrapperNode [2022-04-07 13:02:23,117 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 13:02:23,117 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 13:02:23,117 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 13:02:23,117 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 13:02:23,129 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:02:23" (1/1) ... [2022-04-07 13:02:23,129 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:02:23" (1/1) ... [2022-04-07 13:02:23,142 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:02:23" (1/1) ... [2022-04-07 13:02:23,143 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:02:23" (1/1) ... [2022-04-07 13:02:23,148 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:02:23" (1/1) ... [2022-04-07 13:02:23,151 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:02:23" (1/1) ... [2022-04-07 13:02:23,152 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:02:23" (1/1) ... [2022-04-07 13:02:23,153 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 13:02:23,154 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 13:02:23,154 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 13:02:23,154 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 13:02:23,154 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:02:23" (1/1) ... [2022-04-07 13:02:23,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 13:02:23,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:02:23,189 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-07 13:02:23,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-07 13:02:23,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 13:02:23,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 13:02:23,220 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 13:02:23,221 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 13:02:23,222 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 13:02:23,222 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 13:02:23,223 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 13:02:23,223 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 13:02:23,223 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 13:02:23,223 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 13:02:23,223 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-07 13:02:23,223 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 13:02:23,223 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 13:02:23,223 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 13:02:23,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 13:02:23,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 13:02:23,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 13:02:23,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 13:02:23,224 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 13:02:23,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 13:02:23,264 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 13:02:23,265 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 13:02:23,444 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 13:02:23,449 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 13:02:23,449 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-07 13:02:23,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 01:02:23 BoogieIcfgContainer [2022-04-07 13:02:23,450 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 13:02:23,451 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 13:02:23,451 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 13:02:23,456 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 13:02:23,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 01:02:22" (1/3) ... [2022-04-07 13:02:23,457 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f586ea7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 01:02:23, skipping insertion in model container [2022-04-07 13:02:23,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:02:23" (2/3) ... [2022-04-07 13:02:23,457 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f586ea7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 01:02:23, skipping insertion in model container [2022-04-07 13:02:23,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 01:02:23" (3/3) ... [2022-04-07 13:02:23,458 INFO L111 eAbstractionObserver]: Analyzing ICFG dijkstra-u_unwindbound5.c [2022-04-07 13:02:23,461 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 13:02:23,461 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 13:02:23,488 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 13:02:23,493 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-07 13:02:23,493 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 13:02:23,505 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-07 13:02:23,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-07 13:02:23,509 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:02:23,509 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 13:02:23,509 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:02:23,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:02:23,513 INFO L85 PathProgramCache]: Analyzing trace with hash -2024343623, now seen corresponding path program 1 times [2022-04-07 13:02:23,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:02:23,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023439815] [2022-04-07 13:02:23,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:02:23,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:02:23,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:02:23,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 13:02:23,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:02:23,673 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-07 13:02:23,674 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-07 13:02:23,674 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42#true} {42#true} #102#return; {42#true} is VALID [2022-04-07 13:02:23,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-07 13:02:23,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:02:23,680 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-07 13:02:23,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-07 13:02:23,681 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-07 13:02:23,681 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {42#true} #82#return; {43#false} is VALID [2022-04-07 13:02:23,682 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-07 13:02:23,682 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-07 13:02:23,683 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-07 13:02:23,683 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} #102#return; {42#true} is VALID [2022-04-07 13:02:23,683 INFO L272 TraceCheckUtils]: 4: Hoare triple {42#true} call #t~ret7 := main(); {42#true} is VALID [2022-04-07 13:02:23,683 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-07 13:02:23,683 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-07 13:02:23,683 INFO L290 TraceCheckUtils]: 7: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-07 13:02:23,684 INFO L290 TraceCheckUtils]: 8: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-07 13:02:23,684 INFO L290 TraceCheckUtils]: 9: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-07 13:02:23,684 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {43#false} {42#true} #82#return; {43#false} is VALID [2022-04-07 13:02:23,684 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-07 13:02:23,684 INFO L290 TraceCheckUtils]: 12: Hoare triple {43#false} assume !true; {43#false} is VALID [2022-04-07 13:02:23,685 INFO L290 TraceCheckUtils]: 13: Hoare triple {43#false} assume !true; {43#false} is VALID [2022-04-07 13:02:23,685 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-07 13:02:23,685 INFO L290 TraceCheckUtils]: 15: Hoare triple {43#false} ~cond := #in~cond; {43#false} is VALID [2022-04-07 13:02:23,685 INFO L290 TraceCheckUtils]: 16: Hoare triple {43#false} assume 0 == ~cond; {43#false} is VALID [2022-04-07 13:02:23,685 INFO L290 TraceCheckUtils]: 17: Hoare triple {43#false} assume !false; {43#false} is VALID [2022-04-07 13:02:23,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 13:02:23,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:02:23,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023439815] [2022-04-07 13:02:23,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023439815] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 13:02:23,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 13:02:23,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 13:02:23,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916446457] [2022-04-07 13:02:23,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 13:02:23,691 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-07 13:02:23,692 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:02:23,694 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 13:02:23,717 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:02:23,717 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 13:02:23,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:02:23,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 13:02:23,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 13:02:23,735 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-07 13:02:27,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:02:27,321 INFO L93 Difference]: Finished difference Result 70 states and 111 transitions. [2022-04-07 13:02:27,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 13:02:27,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-07 13:02:27,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:02:27,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 13:02:27,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-04-07 13:02:27,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 13:02:27,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-04-07 13:02:27,337 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 111 transitions. [2022-04-07 13:02:27,446 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-07 13:02:27,457 INFO L225 Difference]: With dead ends: 70 [2022-04-07 13:02:27,457 INFO L226 Difference]: Without dead ends: 35 [2022-04-07 13:02:27,460 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 13:02:27,464 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-07 13:02:27,464 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.4s Time] [2022-04-07 13:02:27,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-07 13:02:27,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-04-07 13:02:27,501 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:02:27,502 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-07 13:02:27,503 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-07 13:02:27,503 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-07 13:02:27,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:02:27,507 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-04-07 13:02:27,507 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2022-04-07 13:02:27,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:02:27,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:02:27,508 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-07 13:02:27,509 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-07 13:02:27,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:02:27,512 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-04-07 13:02:27,512 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2022-04-07 13:02:27,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:02:27,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:02:27,513 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:02:27,515 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:02:27,516 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-07 13:02:27,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2022-04-07 13:02:27,526 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 46 transitions. Word has length 18 [2022-04-07 13:02:27,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:02:27,526 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 46 transitions. [2022-04-07 13:02:27,526 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 13:02:27,526 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2022-04-07 13:02:27,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-07 13:02:27,527 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:02:27,527 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-07 13:02:27,527 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 13:02:27,528 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:02:27,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:02:27,528 INFO L85 PathProgramCache]: Analyzing trace with hash -96361696, now seen corresponding path program 1 times [2022-04-07 13:02:27,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:02:27,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63427341] [2022-04-07 13:02:27,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:02:27,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:02:27,550 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 13:02:27,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1713043126] [2022-04-07 13:02:27,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:02:27,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:02:27,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:02:27,555 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 13:02:27,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-07 13:02:27,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:02:27,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-07 13:02:27,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:02:27,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 13:02:27,761 INFO L272 TraceCheckUtils]: 0: Hoare triple {274#true} call ULTIMATE.init(); {274#true} is VALID [2022-04-07 13:02:27,762 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-07 13:02:27,762 INFO L290 TraceCheckUtils]: 2: Hoare triple {282#(<= ~counter~0 0)} assume true; {282#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:27,763 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {282#(<= ~counter~0 0)} {274#true} #102#return; {282#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:27,763 INFO L272 TraceCheckUtils]: 4: Hoare triple {282#(<= ~counter~0 0)} call #t~ret7 := main(); {282#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:27,763 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-07 13:02:27,764 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-07 13:02:27,764 INFO L290 TraceCheckUtils]: 7: Hoare triple {282#(<= ~counter~0 0)} ~cond := #in~cond; {282#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:27,765 INFO L290 TraceCheckUtils]: 8: Hoare triple {282#(<= ~counter~0 0)} assume !(0 == ~cond); {282#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:27,765 INFO L290 TraceCheckUtils]: 9: Hoare triple {282#(<= ~counter~0 0)} assume true; {282#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:27,766 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {282#(<= ~counter~0 0)} {282#(<= ~counter~0 0)} #82#return; {282#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:27,766 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-07 13:02:27,767 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-07 13:02:27,767 INFO L290 TraceCheckUtils]: 13: Hoare triple {316#(<= |main_#t~post5| 0)} assume !(#t~post5 < 5);havoc #t~post5; {275#false} is VALID [2022-04-07 13:02:27,767 INFO L290 TraceCheckUtils]: 14: Hoare triple {275#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {275#false} is VALID [2022-04-07 13:02:27,767 INFO L290 TraceCheckUtils]: 15: Hoare triple {275#false} assume !(#t~post6 < 5);havoc #t~post6; {275#false} is VALID [2022-04-07 13:02:27,768 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-07 13:02:27,768 INFO L290 TraceCheckUtils]: 17: Hoare triple {275#false} ~cond := #in~cond; {275#false} is VALID [2022-04-07 13:02:27,768 INFO L290 TraceCheckUtils]: 18: Hoare triple {275#false} assume 0 == ~cond; {275#false} is VALID [2022-04-07 13:02:27,768 INFO L290 TraceCheckUtils]: 19: Hoare triple {275#false} assume !false; {275#false} is VALID [2022-04-07 13:02:27,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 13:02:27,768 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 13:02:27,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:02:27,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63427341] [2022-04-07 13:02:27,769 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 13:02:27,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713043126] [2022-04-07 13:02:27,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713043126] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 13:02:27,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 13:02:27,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 13:02:27,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026455798] [2022-04-07 13:02:27,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 13:02:27,771 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-07 13:02:27,771 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:02:27,771 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-07 13:02:27,785 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-07 13:02:27,785 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 13:02:27,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:02:27,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 13:02:27,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 13:02:27,786 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-07 13:02:31,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:02:31,525 INFO L93 Difference]: Finished difference Result 55 states and 78 transitions. [2022-04-07 13:02:31,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 13:02:31,526 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-07 13:02:31,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:02:31,526 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-07 13:02:31,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-04-07 13:02:31,528 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-07 13:02:31,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-04-07 13:02:31,531 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 78 transitions. [2022-04-07 13:02:31,606 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-07 13:02:31,608 INFO L225 Difference]: With dead ends: 55 [2022-04-07 13:02:31,608 INFO L226 Difference]: Without dead ends: 36 [2022-04-07 13:02:31,608 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-07 13:02:31,609 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-07 13:02:31,609 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-07 13:02:31,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-07 13:02:31,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-07 13:02:31,621 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:02:31,623 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-07 13:02:31,624 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-07 13:02:31,624 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-07 13:02:31,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:02:31,631 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2022-04-07 13:02:31,631 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-07 13:02:31,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:02:31,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:02:31,632 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-07 13:02:31,632 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-07 13:02:31,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:02:31,634 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2022-04-07 13:02:31,634 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-07 13:02:31,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:02:31,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:02:31,635 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:02:31,635 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:02:31,635 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-07 13:02:31,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2022-04-07 13:02:31,638 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 20 [2022-04-07 13:02:31,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:02:31,638 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2022-04-07 13:02:31,638 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-07 13:02:31,638 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-07 13:02:31,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-07 13:02:31,639 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:02:31,639 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-07 13:02:31,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-07 13:02:31,856 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:02:31,856 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:02:31,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:02:31,857 INFO L85 PathProgramCache]: Analyzing trace with hash 962099791, now seen corresponding path program 1 times [2022-04-07 13:02:31,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:02:31,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172103711] [2022-04-07 13:02:31,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:02:31,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:02:31,875 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 13:02:31,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [581512174] [2022-04-07 13:02:31,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:02:31,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:02:31,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:02:31,884 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 13:02:31,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-07 13:02:31,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:02:31,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 13:02:31,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:02:31,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 13:02:32,061 INFO L272 TraceCheckUtils]: 0: Hoare triple {546#true} call ULTIMATE.init(); {546#true} is VALID [2022-04-07 13:02:32,061 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-07 13:02:32,062 INFO L290 TraceCheckUtils]: 2: Hoare triple {554#(<= ~counter~0 0)} assume true; {554#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:32,062 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {554#(<= ~counter~0 0)} {546#true} #102#return; {554#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:32,062 INFO L272 TraceCheckUtils]: 4: Hoare triple {554#(<= ~counter~0 0)} call #t~ret7 := main(); {554#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:32,065 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-07 13:02:32,066 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-07 13:02:32,066 INFO L290 TraceCheckUtils]: 7: Hoare triple {554#(<= ~counter~0 0)} ~cond := #in~cond; {554#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:32,066 INFO L290 TraceCheckUtils]: 8: Hoare triple {554#(<= ~counter~0 0)} assume !(0 == ~cond); {554#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:32,067 INFO L290 TraceCheckUtils]: 9: Hoare triple {554#(<= ~counter~0 0)} assume true; {554#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:32,067 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {554#(<= ~counter~0 0)} {554#(<= ~counter~0 0)} #82#return; {554#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:32,070 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-07 13:02:32,070 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-07 13:02:32,071 INFO L290 TraceCheckUtils]: 13: Hoare triple {588#(<= ~counter~0 1)} assume !!(#t~post5 < 5);havoc #t~post5; {588#(<= ~counter~0 1)} is VALID [2022-04-07 13:02:32,071 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-07 13:02:32,072 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-07 13:02:32,072 INFO L290 TraceCheckUtils]: 16: Hoare triple {598#(<= |main_#t~post6| 1)} assume !(#t~post6 < 5);havoc #t~post6; {547#false} is VALID [2022-04-07 13:02:32,072 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-07 13:02:32,072 INFO L290 TraceCheckUtils]: 18: Hoare triple {547#false} ~cond := #in~cond; {547#false} is VALID [2022-04-07 13:02:32,072 INFO L290 TraceCheckUtils]: 19: Hoare triple {547#false} assume 0 == ~cond; {547#false} is VALID [2022-04-07 13:02:32,072 INFO L290 TraceCheckUtils]: 20: Hoare triple {547#false} assume !false; {547#false} is VALID [2022-04-07 13:02:32,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 13:02:32,073 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 13:02:32,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:02:32,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172103711] [2022-04-07 13:02:32,073 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 13:02:32,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581512174] [2022-04-07 13:02:32,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581512174] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 13:02:32,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 13:02:32,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 13:02:32,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946622846] [2022-04-07 13:02:32,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 13:02:32,074 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-07 13:02:32,074 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:02:32,074 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-07 13:02:32,088 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-07 13:02:32,088 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 13:02:32,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:02:32,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 13:02:32,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-07 13:02:32,089 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-07 13:02:36,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:02:36,906 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2022-04-07 13:02:36,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 13:02:36,906 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-07 13:02:36,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:02:36,906 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-07 13:02:36,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-07 13:02:36,908 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-07 13:02:36,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-07 13:02:36,909 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-07 13:02:36,965 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-07 13:02:36,967 INFO L225 Difference]: With dead ends: 49 [2022-04-07 13:02:36,967 INFO L226 Difference]: Without dead ends: 40 [2022-04-07 13:02:36,967 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-07 13:02:36,968 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-07 13:02:36,968 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-07 13:02:36,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-07 13:02:36,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2022-04-07 13:02:36,994 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:02:36,995 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-07 13:02:36,998 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-07 13:02:36,998 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-07 13:02:37,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:02:37,002 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2022-04-07 13:02:37,002 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2022-04-07 13:02:37,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:02:37,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:02:37,003 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-07 13:02:37,004 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-07 13:02:37,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:02:37,006 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2022-04-07 13:02:37,006 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2022-04-07 13:02:37,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:02:37,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:02:37,007 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:02:37,007 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:02:37,007 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-07 13:02:37,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 52 transitions. [2022-04-07 13:02:37,009 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 52 transitions. Word has length 21 [2022-04-07 13:02:37,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:02:37,009 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 52 transitions. [2022-04-07 13:02:37,009 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-07 13:02:37,009 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 52 transitions. [2022-04-07 13:02:37,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-07 13:02:37,010 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:02:37,010 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-07 13:02:37,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-07 13:02:37,219 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-07 13:02:37,219 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:02:37,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:02:37,220 INFO L85 PathProgramCache]: Analyzing trace with hash 963589341, now seen corresponding path program 1 times [2022-04-07 13:02:37,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:02:37,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050002547] [2022-04-07 13:02:37,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:02:37,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:02:37,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:02:37,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 13:02:37,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:02:37,380 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-07 13:02:37,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-07 13:02:37,380 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {822#true} {822#true} #102#return; {822#true} is VALID [2022-04-07 13:02:37,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-07 13:02:37,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:02:37,383 INFO L290 TraceCheckUtils]: 0: Hoare triple {822#true} ~cond := #in~cond; {822#true} is VALID [2022-04-07 13:02:37,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {822#true} assume !(0 == ~cond); {822#true} is VALID [2022-04-07 13:02:37,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-07 13:02:37,384 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {822#true} {822#true} #82#return; {822#true} is VALID [2022-04-07 13:02:37,385 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-07 13:02:37,385 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-07 13:02:37,385 INFO L290 TraceCheckUtils]: 2: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-07 13:02:37,385 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {822#true} {822#true} #102#return; {822#true} is VALID [2022-04-07 13:02:37,385 INFO L272 TraceCheckUtils]: 4: Hoare triple {822#true} call #t~ret7 := main(); {822#true} is VALID [2022-04-07 13:02:37,385 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-07 13:02:37,385 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-07 13:02:37,385 INFO L290 TraceCheckUtils]: 7: Hoare triple {822#true} ~cond := #in~cond; {822#true} is VALID [2022-04-07 13:02:37,386 INFO L290 TraceCheckUtils]: 8: Hoare triple {822#true} assume !(0 == ~cond); {822#true} is VALID [2022-04-07 13:02:37,386 INFO L290 TraceCheckUtils]: 9: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-07 13:02:37,386 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {822#true} {822#true} #82#return; {822#true} is VALID [2022-04-07 13:02:37,390 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-07 13:02:37,390 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-07 13:02:37,391 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 < 5);havoc #t~post5; {831#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-07 13:02:37,392 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-07 13:02:37,393 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-07 13:02:37,393 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 < 5);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-07 13:02:37,394 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-07 13:02:37,395 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-07 13:02:37,395 INFO L290 TraceCheckUtils]: 19: Hoare triple {834#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {823#false} is VALID [2022-04-07 13:02:37,395 INFO L290 TraceCheckUtils]: 20: Hoare triple {823#false} assume !false; {823#false} is VALID [2022-04-07 13:02:37,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 13:02:37,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:02:37,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050002547] [2022-04-07 13:02:37,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050002547] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 13:02:37,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 13:02:37,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-07 13:02:37,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096824546] [2022-04-07 13:02:37,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 13:02:37,398 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-07 13:02:37,398 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:02:37,398 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-07 13:02:37,421 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-07 13:02:37,422 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-07 13:02:37,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:02:37,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-07 13:02:37,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-07 13:02:37,422 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-07 13:02:45,418 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:02:47,420 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:02:48,896 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 13:02:50,899 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 13:02:52,933 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:02:54,935 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:02:58,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:02:58,026 INFO L93 Difference]: Finished difference Result 72 states and 104 transitions. [2022-04-07 13:02:58,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-07 13:02:58,026 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-07 13:02:58,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:02:58,027 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-07 13:02:58,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2022-04-07 13:02:58,029 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-07 13:02:58,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2022-04-07 13:02:58,030 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 104 transitions. [2022-04-07 13:02:58,307 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-07 13:02:58,308 INFO L225 Difference]: With dead ends: 72 [2022-04-07 13:02:58,308 INFO L226 Difference]: Without dead ends: 51 [2022-04-07 13:02:58,309 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-07 13:02:58,309 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 24 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 37 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.6s IncrementalHoareTripleChecker+Time [2022-04-07 13:02:58,309 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 107 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 204 Invalid, 5 Unknown, 0 Unchecked, 15.6s Time] [2022-04-07 13:02:58,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-07 13:02:58,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-07 13:02:58,322 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:02:58,322 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-07 13:02:58,322 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-07 13:02:58,323 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-07 13:02:58,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:02:58,325 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-04-07 13:02:58,325 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2022-04-07 13:02:58,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:02:58,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:02:58,326 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-07 13:02:58,326 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-07 13:02:58,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:02:58,328 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-04-07 13:02:58,328 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2022-04-07 13:02:58,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:02:58,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:02:58,328 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:02:58,328 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:02:58,329 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-07 13:02:58,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 69 transitions. [2022-04-07 13:02:58,330 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 69 transitions. Word has length 21 [2022-04-07 13:02:58,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:02:58,330 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 69 transitions. [2022-04-07 13:02:58,331 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-07 13:02:58,331 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2022-04-07 13:02:58,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-07 13:02:58,331 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:02:58,331 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-07 13:02:58,331 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-07 13:02:58,331 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:02:58,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:02:58,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1701877900, now seen corresponding path program 1 times [2022-04-07 13:02:58,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:02:58,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723015667] [2022-04-07 13:02:58,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:02:58,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:02:58,341 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 13:02:58,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1233060178] [2022-04-07 13:02:58,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:02:58,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:02:58,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:02:58,342 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 13:02:58,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-07 13:02:58,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:02:58,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 13:02:58,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:02:58,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 13:02:58,477 INFO L272 TraceCheckUtils]: 0: Hoare triple {1137#true} call ULTIMATE.init(); {1137#true} is VALID [2022-04-07 13:02:58,477 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-07 13:02:58,478 INFO L290 TraceCheckUtils]: 2: Hoare triple {1145#(<= ~counter~0 0)} assume true; {1145#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:58,478 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1145#(<= ~counter~0 0)} {1137#true} #102#return; {1145#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:58,478 INFO L272 TraceCheckUtils]: 4: Hoare triple {1145#(<= ~counter~0 0)} call #t~ret7 := main(); {1145#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:58,478 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-07 13:02:58,479 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-07 13:02:58,479 INFO L290 TraceCheckUtils]: 7: Hoare triple {1145#(<= ~counter~0 0)} ~cond := #in~cond; {1145#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:58,481 INFO L290 TraceCheckUtils]: 8: Hoare triple {1145#(<= ~counter~0 0)} assume !(0 == ~cond); {1145#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:58,482 INFO L290 TraceCheckUtils]: 9: Hoare triple {1145#(<= ~counter~0 0)} assume true; {1145#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:58,482 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1145#(<= ~counter~0 0)} {1145#(<= ~counter~0 0)} #82#return; {1145#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:58,482 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-07 13:02:58,483 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-07 13:02:58,483 INFO L290 TraceCheckUtils]: 13: Hoare triple {1179#(<= ~counter~0 1)} assume !!(#t~post5 < 5);havoc #t~post5; {1179#(<= ~counter~0 1)} is VALID [2022-04-07 13:02:58,483 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-07 13:02:58,484 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-07 13:02:58,484 INFO L290 TraceCheckUtils]: 16: Hoare triple {1189#(<= |main_#t~post5| 1)} assume !(#t~post5 < 5);havoc #t~post5; {1138#false} is VALID [2022-04-07 13:02:58,484 INFO L290 TraceCheckUtils]: 17: Hoare triple {1138#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1138#false} is VALID [2022-04-07 13:02:58,484 INFO L290 TraceCheckUtils]: 18: Hoare triple {1138#false} assume !(#t~post6 < 5);havoc #t~post6; {1138#false} is VALID [2022-04-07 13:02:58,484 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-07 13:02:58,485 INFO L290 TraceCheckUtils]: 20: Hoare triple {1138#false} ~cond := #in~cond; {1138#false} is VALID [2022-04-07 13:02:58,486 INFO L290 TraceCheckUtils]: 21: Hoare triple {1138#false} assume 0 == ~cond; {1138#false} is VALID [2022-04-07 13:02:58,486 INFO L290 TraceCheckUtils]: 22: Hoare triple {1138#false} assume !false; {1138#false} is VALID [2022-04-07 13:02:58,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 13:02:58,486 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 13:02:58,615 INFO L290 TraceCheckUtils]: 22: Hoare triple {1138#false} assume !false; {1138#false} is VALID [2022-04-07 13:02:58,616 INFO L290 TraceCheckUtils]: 21: Hoare triple {1138#false} assume 0 == ~cond; {1138#false} is VALID [2022-04-07 13:02:58,617 INFO L290 TraceCheckUtils]: 20: Hoare triple {1138#false} ~cond := #in~cond; {1138#false} is VALID [2022-04-07 13:02:58,617 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-07 13:02:58,617 INFO L290 TraceCheckUtils]: 18: Hoare triple {1138#false} assume !(#t~post6 < 5);havoc #t~post6; {1138#false} is VALID [2022-04-07 13:02:58,617 INFO L290 TraceCheckUtils]: 17: Hoare triple {1138#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1138#false} is VALID [2022-04-07 13:02:58,624 INFO L290 TraceCheckUtils]: 16: Hoare triple {1229#(< |main_#t~post5| 5)} assume !(#t~post5 < 5);havoc #t~post5; {1138#false} is VALID [2022-04-07 13:02:58,625 INFO L290 TraceCheckUtils]: 15: Hoare triple {1233#(< ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1229#(< |main_#t~post5| 5)} is VALID [2022-04-07 13:02:58,625 INFO L290 TraceCheckUtils]: 14: Hoare triple {1233#(< ~counter~0 5)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {1233#(< ~counter~0 5)} is VALID [2022-04-07 13:02:58,626 INFO L290 TraceCheckUtils]: 13: Hoare triple {1233#(< ~counter~0 5)} assume !!(#t~post5 < 5);havoc #t~post5; {1233#(< ~counter~0 5)} is VALID [2022-04-07 13:02:58,626 INFO L290 TraceCheckUtils]: 12: Hoare triple {1243#(< ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1233#(< ~counter~0 5)} is VALID [2022-04-07 13:02:58,626 INFO L290 TraceCheckUtils]: 11: Hoare triple {1243#(< ~counter~0 4)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1243#(< ~counter~0 4)} is VALID [2022-04-07 13:02:58,627 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1137#true} {1243#(< ~counter~0 4)} #82#return; {1243#(< ~counter~0 4)} is VALID [2022-04-07 13:02:58,627 INFO L290 TraceCheckUtils]: 9: Hoare triple {1137#true} assume true; {1137#true} is VALID [2022-04-07 13:02:58,627 INFO L290 TraceCheckUtils]: 8: Hoare triple {1137#true} assume !(0 == ~cond); {1137#true} is VALID [2022-04-07 13:02:58,627 INFO L290 TraceCheckUtils]: 7: Hoare triple {1137#true} ~cond := #in~cond; {1137#true} is VALID [2022-04-07 13:02:58,627 INFO L272 TraceCheckUtils]: 6: Hoare triple {1243#(< ~counter~0 4)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1137#true} is VALID [2022-04-07 13:02:58,628 INFO L290 TraceCheckUtils]: 5: Hoare triple {1243#(< ~counter~0 4)} 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 4)} is VALID [2022-04-07 13:02:58,628 INFO L272 TraceCheckUtils]: 4: Hoare triple {1243#(< ~counter~0 4)} call #t~ret7 := main(); {1243#(< ~counter~0 4)} is VALID [2022-04-07 13:02:58,629 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1243#(< ~counter~0 4)} {1137#true} #102#return; {1243#(< ~counter~0 4)} is VALID [2022-04-07 13:02:58,629 INFO L290 TraceCheckUtils]: 2: Hoare triple {1243#(< ~counter~0 4)} assume true; {1243#(< ~counter~0 4)} is VALID [2022-04-07 13:02:58,629 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 4)} is VALID [2022-04-07 13:02:58,630 INFO L272 TraceCheckUtils]: 0: Hoare triple {1137#true} call ULTIMATE.init(); {1137#true} is VALID [2022-04-07 13:02:58,630 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 13:02:58,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:02:58,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723015667] [2022-04-07 13:02:58,630 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 13:02:58,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233060178] [2022-04-07 13:02:58,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233060178] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 13:02:58,630 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 13:02:58,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-07 13:02:58,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317300767] [2022-04-07 13:02:58,631 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 13:02:58,631 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-07 13:02:58,631 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:02:58,631 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-07 13:02:58,667 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:02:58,668 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-07 13:02:58,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:02:58,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-07 13:02:58,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-07 13:02:58,668 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-07 13:03:05,965 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 13:03:13,054 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 13:03:19,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:03:19,617 INFO L93 Difference]: Finished difference Result 104 states and 146 transitions. [2022-04-07 13:03:19,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-07 13:03:19,618 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-07 13:03:19,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:03:19,619 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-07 13:03:19,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 143 transitions. [2022-04-07 13:03:19,623 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-07 13:03:19,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 143 transitions. [2022-04-07 13:03:19,627 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 143 transitions. [2022-04-07 13:03:19,739 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-07 13:03:19,741 INFO L225 Difference]: With dead ends: 104 [2022-04-07 13:03:19,741 INFO L226 Difference]: Without dead ends: 85 [2022-04-07 13:03:19,741 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-07 13:03:19,742 INFO L913 BasicCegarLoop]: 61 mSDtfsCounter, 72 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 28 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2022-04-07 13:03:19,742 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 256 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 88 Invalid, 2 Unknown, 0 Unchecked, 10.2s Time] [2022-04-07 13:03:19,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-07 13:03:19,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 63. [2022-04-07 13:03:19,760 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:03:19,760 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 63 states, 38 states have (on average 1.263157894736842) internal successors, (48), 40 states have internal predecessors, (48), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-07 13:03:19,761 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 63 states, 38 states have (on average 1.263157894736842) internal successors, (48), 40 states have internal predecessors, (48), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-07 13:03:19,761 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 63 states, 38 states have (on average 1.263157894736842) internal successors, (48), 40 states have internal predecessors, (48), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-07 13:03:19,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:03:19,764 INFO L93 Difference]: Finished difference Result 85 states and 114 transitions. [2022-04-07 13:03:19,764 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 114 transitions. [2022-04-07 13:03:19,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:03:19,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:03:19,764 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 38 states have (on average 1.263157894736842) internal successors, (48), 40 states have internal predecessors, (48), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 85 states. [2022-04-07 13:03:19,765 INFO L87 Difference]: Start difference. First operand has 63 states, 38 states have (on average 1.263157894736842) internal successors, (48), 40 states have internal predecessors, (48), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 85 states. [2022-04-07 13:03:19,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:03:19,797 INFO L93 Difference]: Finished difference Result 85 states and 114 transitions. [2022-04-07 13:03:19,797 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 114 transitions. [2022-04-07 13:03:19,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:03:19,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:03:19,798 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:03:19,798 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:03:19,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 38 states have (on average 1.263157894736842) internal successors, (48), 40 states have internal predecessors, (48), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-07 13:03:19,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 83 transitions. [2022-04-07 13:03:19,800 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 83 transitions. Word has length 23 [2022-04-07 13:03:19,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:03:19,800 INFO L478 AbstractCegarLoop]: Abstraction has 63 states and 83 transitions. [2022-04-07 13:03:19,800 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-07 13:03:19,801 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 83 transitions. [2022-04-07 13:03:19,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-07 13:03:19,801 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:03:19,801 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-07 13:03:19,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-07 13:03:20,007 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-07 13:03:20,008 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:03:20,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:03:20,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1564262277, now seen corresponding path program 1 times [2022-04-07 13:03:20,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:03:20,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718564920] [2022-04-07 13:03:20,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:03:20,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:03:20,018 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 13:03:20,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2134839247] [2022-04-07 13:03:20,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:03:20,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:03:20,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:03:20,020 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 13:03:20,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-07 13:03:20,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:03:20,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-07 13:03:20,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:03:20,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 13:03:20,179 INFO L272 TraceCheckUtils]: 0: Hoare triple {1705#true} call ULTIMATE.init(); {1705#true} is VALID [2022-04-07 13:03:20,180 INFO L290 TraceCheckUtils]: 1: Hoare triple {1705#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; {1713#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:20,180 INFO L290 TraceCheckUtils]: 2: Hoare triple {1713#(<= ~counter~0 0)} assume true; {1713#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:20,180 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1713#(<= ~counter~0 0)} {1705#true} #102#return; {1713#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:20,181 INFO L272 TraceCheckUtils]: 4: Hoare triple {1713#(<= ~counter~0 0)} call #t~ret7 := main(); {1713#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:20,181 INFO L290 TraceCheckUtils]: 5: Hoare triple {1713#(<= ~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; {1713#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:20,181 INFO L272 TraceCheckUtils]: 6: Hoare triple {1713#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1713#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:20,190 INFO L290 TraceCheckUtils]: 7: Hoare triple {1713#(<= ~counter~0 0)} ~cond := #in~cond; {1713#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:20,190 INFO L290 TraceCheckUtils]: 8: Hoare triple {1713#(<= ~counter~0 0)} assume !(0 == ~cond); {1713#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:20,190 INFO L290 TraceCheckUtils]: 9: Hoare triple {1713#(<= ~counter~0 0)} assume true; {1713#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:20,191 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1713#(<= ~counter~0 0)} {1713#(<= ~counter~0 0)} #82#return; {1713#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:20,191 INFO L290 TraceCheckUtils]: 11: Hoare triple {1713#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1713#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:20,192 INFO L290 TraceCheckUtils]: 12: Hoare triple {1713#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1747#(<= ~counter~0 1)} is VALID [2022-04-07 13:03:20,192 INFO L290 TraceCheckUtils]: 13: Hoare triple {1747#(<= ~counter~0 1)} assume !!(#t~post5 < 5);havoc #t~post5; {1747#(<= ~counter~0 1)} is VALID [2022-04-07 13:03:20,192 INFO L290 TraceCheckUtils]: 14: Hoare triple {1747#(<= ~counter~0 1)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {1747#(<= ~counter~0 1)} is VALID [2022-04-07 13:03:20,193 INFO L290 TraceCheckUtils]: 15: Hoare triple {1747#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1757#(<= ~counter~0 2)} is VALID [2022-04-07 13:03:20,193 INFO L290 TraceCheckUtils]: 16: Hoare triple {1757#(<= ~counter~0 2)} assume !!(#t~post5 < 5);havoc #t~post5; {1757#(<= ~counter~0 2)} is VALID [2022-04-07 13:03:20,193 INFO L290 TraceCheckUtils]: 17: Hoare triple {1757#(<= ~counter~0 2)} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {1757#(<= ~counter~0 2)} is VALID [2022-04-07 13:03:20,194 INFO L290 TraceCheckUtils]: 18: Hoare triple {1757#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1767#(<= |main_#t~post6| 2)} is VALID [2022-04-07 13:03:20,194 INFO L290 TraceCheckUtils]: 19: Hoare triple {1767#(<= |main_#t~post6| 2)} assume !(#t~post6 < 5);havoc #t~post6; {1706#false} is VALID [2022-04-07 13:03:20,194 INFO L272 TraceCheckUtils]: 20: Hoare triple {1706#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)); {1706#false} is VALID [2022-04-07 13:03:20,194 INFO L290 TraceCheckUtils]: 21: Hoare triple {1706#false} ~cond := #in~cond; {1706#false} is VALID [2022-04-07 13:03:20,194 INFO L290 TraceCheckUtils]: 22: Hoare triple {1706#false} assume 0 == ~cond; {1706#false} is VALID [2022-04-07 13:03:20,194 INFO L290 TraceCheckUtils]: 23: Hoare triple {1706#false} assume !false; {1706#false} is VALID [2022-04-07 13:03:20,194 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-07 13:03:20,194 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 13:03:20,340 INFO L290 TraceCheckUtils]: 23: Hoare triple {1706#false} assume !false; {1706#false} is VALID [2022-04-07 13:03:20,340 INFO L290 TraceCheckUtils]: 22: Hoare triple {1706#false} assume 0 == ~cond; {1706#false} is VALID [2022-04-07 13:03:20,340 INFO L290 TraceCheckUtils]: 21: Hoare triple {1706#false} ~cond := #in~cond; {1706#false} is VALID [2022-04-07 13:03:20,340 INFO L272 TraceCheckUtils]: 20: Hoare triple {1706#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)); {1706#false} is VALID [2022-04-07 13:03:20,340 INFO L290 TraceCheckUtils]: 19: Hoare triple {1795#(< |main_#t~post6| 5)} assume !(#t~post6 < 5);havoc #t~post6; {1706#false} is VALID [2022-04-07 13:03:20,341 INFO L290 TraceCheckUtils]: 18: Hoare triple {1799#(< ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1795#(< |main_#t~post6| 5)} is VALID [2022-04-07 13:03:20,341 INFO L290 TraceCheckUtils]: 17: Hoare triple {1799#(< ~counter~0 5)} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {1799#(< ~counter~0 5)} is VALID [2022-04-07 13:03:20,341 INFO L290 TraceCheckUtils]: 16: Hoare triple {1799#(< ~counter~0 5)} assume !!(#t~post5 < 5);havoc #t~post5; {1799#(< ~counter~0 5)} is VALID [2022-04-07 13:03:20,342 INFO L290 TraceCheckUtils]: 15: Hoare triple {1809#(< ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1799#(< ~counter~0 5)} is VALID [2022-04-07 13:03:20,342 INFO L290 TraceCheckUtils]: 14: Hoare triple {1809#(< ~counter~0 4)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {1809#(< ~counter~0 4)} is VALID [2022-04-07 13:03:20,342 INFO L290 TraceCheckUtils]: 13: Hoare triple {1809#(< ~counter~0 4)} assume !!(#t~post5 < 5);havoc #t~post5; {1809#(< ~counter~0 4)} is VALID [2022-04-07 13:03:20,343 INFO L290 TraceCheckUtils]: 12: Hoare triple {1757#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1809#(< ~counter~0 4)} is VALID [2022-04-07 13:03:20,343 INFO L290 TraceCheckUtils]: 11: Hoare triple {1757#(<= ~counter~0 2)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1757#(<= ~counter~0 2)} is VALID [2022-04-07 13:03:20,343 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1705#true} {1757#(<= ~counter~0 2)} #82#return; {1757#(<= ~counter~0 2)} is VALID [2022-04-07 13:03:20,343 INFO L290 TraceCheckUtils]: 9: Hoare triple {1705#true} assume true; {1705#true} is VALID [2022-04-07 13:03:20,343 INFO L290 TraceCheckUtils]: 8: Hoare triple {1705#true} assume !(0 == ~cond); {1705#true} is VALID [2022-04-07 13:03:20,344 INFO L290 TraceCheckUtils]: 7: Hoare triple {1705#true} ~cond := #in~cond; {1705#true} is VALID [2022-04-07 13:03:20,344 INFO L272 TraceCheckUtils]: 6: Hoare triple {1757#(<= ~counter~0 2)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1705#true} is VALID [2022-04-07 13:03:20,344 INFO L290 TraceCheckUtils]: 5: Hoare triple {1757#(<= ~counter~0 2)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1757#(<= ~counter~0 2)} is VALID [2022-04-07 13:03:20,345 INFO L272 TraceCheckUtils]: 4: Hoare triple {1757#(<= ~counter~0 2)} call #t~ret7 := main(); {1757#(<= ~counter~0 2)} is VALID [2022-04-07 13:03:20,345 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1757#(<= ~counter~0 2)} {1705#true} #102#return; {1757#(<= ~counter~0 2)} is VALID [2022-04-07 13:03:20,347 INFO L290 TraceCheckUtils]: 2: Hoare triple {1757#(<= ~counter~0 2)} assume true; {1757#(<= ~counter~0 2)} is VALID [2022-04-07 13:03:20,348 INFO L290 TraceCheckUtils]: 1: Hoare triple {1705#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; {1757#(<= ~counter~0 2)} is VALID [2022-04-07 13:03:20,348 INFO L272 TraceCheckUtils]: 0: Hoare triple {1705#true} call ULTIMATE.init(); {1705#true} is VALID [2022-04-07 13:03:20,348 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-07 13:03:20,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:03:20,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718564920] [2022-04-07 13:03:20,348 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 13:03:20,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134839247] [2022-04-07 13:03:20,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134839247] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 13:03:20,348 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 13:03:20,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-04-07 13:03:20,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829399055] [2022-04-07 13:03:20,348 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 13:03:20,349 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 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-07 13:03:20,349 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:03:20,349 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 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-07 13:03:20,373 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-07 13:03:20,373 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-07 13:03:20,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:03:20,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-07 13:03:20,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-07 13:03:20,374 INFO L87 Difference]: Start difference. First operand 63 states and 83 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 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-07 13:03:24,373 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:03:26,774 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 13:03:30,183 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:03:32,738 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 13:03:38,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:03:38,871 INFO L93 Difference]: Finished difference Result 116 states and 158 transitions. [2022-04-07 13:03:38,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-07 13:03:38,871 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 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-07 13:03:38,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:03:38,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 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-07 13:03:38,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 155 transitions. [2022-04-07 13:03:38,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 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-07 13:03:38,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 155 transitions. [2022-04-07 13:03:38,875 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 155 transitions. [2022-04-07 13:03:38,992 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:03:38,994 INFO L225 Difference]: With dead ends: 116 [2022-04-07 13:03:38,994 INFO L226 Difference]: Without dead ends: 107 [2022-04-07 13:03:38,994 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-04-07 13:03:38,994 INFO L913 BasicCegarLoop]: 70 mSDtfsCounter, 109 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 65 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2022-04-07 13:03:38,995 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 281 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 86 Invalid, 4 Unknown, 0 Unchecked, 10.8s Time] [2022-04-07 13:03:38,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-04-07 13:03:39,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 100. [2022-04-07 13:03:39,041 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:03:39,043 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand has 100 states, 55 states have (on average 1.309090909090909) internal successors, (72), 59 states have internal predecessors, (72), 37 states have call successors, (37), 8 states have call predecessors, (37), 7 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-07 13:03:39,044 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand has 100 states, 55 states have (on average 1.309090909090909) internal successors, (72), 59 states have internal predecessors, (72), 37 states have call successors, (37), 8 states have call predecessors, (37), 7 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-07 13:03:39,044 INFO L87 Difference]: Start difference. First operand 107 states. Second operand has 100 states, 55 states have (on average 1.309090909090909) internal successors, (72), 59 states have internal predecessors, (72), 37 states have call successors, (37), 8 states have call predecessors, (37), 7 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-07 13:03:39,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:03:39,047 INFO L93 Difference]: Finished difference Result 107 states and 145 transitions. [2022-04-07 13:03:39,047 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 145 transitions. [2022-04-07 13:03:39,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:03:39,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:03:39,049 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 55 states have (on average 1.309090909090909) internal successors, (72), 59 states have internal predecessors, (72), 37 states have call successors, (37), 8 states have call predecessors, (37), 7 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand 107 states. [2022-04-07 13:03:39,049 INFO L87 Difference]: Start difference. First operand has 100 states, 55 states have (on average 1.309090909090909) internal successors, (72), 59 states have internal predecessors, (72), 37 states have call successors, (37), 8 states have call predecessors, (37), 7 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand 107 states. [2022-04-07 13:03:39,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:03:39,053 INFO L93 Difference]: Finished difference Result 107 states and 145 transitions. [2022-04-07 13:03:39,053 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 145 transitions. [2022-04-07 13:03:39,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:03:39,054 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:03:39,054 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:03:39,054 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:03:39,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 55 states have (on average 1.309090909090909) internal successors, (72), 59 states have internal predecessors, (72), 37 states have call successors, (37), 8 states have call predecessors, (37), 7 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-07 13:03:39,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 141 transitions. [2022-04-07 13:03:39,057 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 141 transitions. Word has length 24 [2022-04-07 13:03:39,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:03:39,057 INFO L478 AbstractCegarLoop]: Abstraction has 100 states and 141 transitions. [2022-04-07 13:03:39,058 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 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-07 13:03:39,058 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 141 transitions. [2022-04-07 13:03:39,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-07 13:03:39,058 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:03:39,058 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-07 13:03:39,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-07 13:03:39,271 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-07 13:03:39,271 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:03:39,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:03:39,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1562772727, now seen corresponding path program 1 times [2022-04-07 13:03:39,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:03:39,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638295062] [2022-04-07 13:03:39,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:03:39,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:03:39,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:03:39,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 13:03:39,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:03:39,457 INFO L290 TraceCheckUtils]: 0: Hoare triple {2412#(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; {2398#true} is VALID [2022-04-07 13:03:39,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {2398#true} assume true; {2398#true} is VALID [2022-04-07 13:03:39,458 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2398#true} {2398#true} #102#return; {2398#true} is VALID [2022-04-07 13:03:39,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-07 13:03:39,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:03:39,461 INFO L290 TraceCheckUtils]: 0: Hoare triple {2398#true} ~cond := #in~cond; {2398#true} is VALID [2022-04-07 13:03:39,461 INFO L290 TraceCheckUtils]: 1: Hoare triple {2398#true} assume !(0 == ~cond); {2398#true} is VALID [2022-04-07 13:03:39,461 INFO L290 TraceCheckUtils]: 2: Hoare triple {2398#true} assume true; {2398#true} is VALID [2022-04-07 13:03:39,461 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2398#true} {2398#true} #82#return; {2398#true} is VALID [2022-04-07 13:03:39,462 INFO L272 TraceCheckUtils]: 0: Hoare triple {2398#true} call ULTIMATE.init(); {2412#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 13:03:39,462 INFO L290 TraceCheckUtils]: 1: Hoare triple {2412#(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; {2398#true} is VALID [2022-04-07 13:03:39,462 INFO L290 TraceCheckUtils]: 2: Hoare triple {2398#true} assume true; {2398#true} is VALID [2022-04-07 13:03:39,462 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2398#true} {2398#true} #102#return; {2398#true} is VALID [2022-04-07 13:03:39,462 INFO L272 TraceCheckUtils]: 4: Hoare triple {2398#true} call #t~ret7 := main(); {2398#true} is VALID [2022-04-07 13:03:39,462 INFO L290 TraceCheckUtils]: 5: Hoare triple {2398#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {2398#true} is VALID [2022-04-07 13:03:39,462 INFO L272 TraceCheckUtils]: 6: Hoare triple {2398#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {2398#true} is VALID [2022-04-07 13:03:39,462 INFO L290 TraceCheckUtils]: 7: Hoare triple {2398#true} ~cond := #in~cond; {2398#true} is VALID [2022-04-07 13:03:39,462 INFO L290 TraceCheckUtils]: 8: Hoare triple {2398#true} assume !(0 == ~cond); {2398#true} is VALID [2022-04-07 13:03:39,463 INFO L290 TraceCheckUtils]: 9: Hoare triple {2398#true} assume true; {2398#true} is VALID [2022-04-07 13:03:39,463 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2398#true} {2398#true} #82#return; {2398#true} is VALID [2022-04-07 13:03:39,463 INFO L290 TraceCheckUtils]: 11: Hoare triple {2398#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {2407#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-07 13:03:39,463 INFO L290 TraceCheckUtils]: 12: Hoare triple {2407#(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; {2407#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-07 13:03:39,464 INFO L290 TraceCheckUtils]: 13: Hoare triple {2407#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !!(#t~post5 < 5);havoc #t~post5; {2407#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-07 13:03:39,464 INFO L290 TraceCheckUtils]: 14: Hoare triple {2407#(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; {2408#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-07 13:03:39,465 INFO L290 TraceCheckUtils]: 15: Hoare triple {2408#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2408#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-07 13:03:39,465 INFO L290 TraceCheckUtils]: 16: Hoare triple {2408#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !!(#t~post5 < 5);havoc #t~post5; {2408#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-07 13:03:39,466 INFO L290 TraceCheckUtils]: 17: Hoare triple {2408#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {2409#(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-07 13:03:39,466 INFO L290 TraceCheckUtils]: 18: Hoare triple {2409#(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; {2409#(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-07 13:03:39,466 INFO L290 TraceCheckUtils]: 19: Hoare triple {2409#(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 < 5);havoc #t~post6; {2409#(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-07 13:03:39,467 INFO L272 TraceCheckUtils]: 20: Hoare triple {2409#(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)); {2410#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 13:03:39,468 INFO L290 TraceCheckUtils]: 21: Hoare triple {2410#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2411#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 13:03:39,468 INFO L290 TraceCheckUtils]: 22: Hoare triple {2411#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2399#false} is VALID [2022-04-07 13:03:39,468 INFO L290 TraceCheckUtils]: 23: Hoare triple {2399#false} assume !false; {2399#false} is VALID [2022-04-07 13:03:39,469 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-07 13:03:39,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:03:39,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638295062] [2022-04-07 13:03:39,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638295062] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 13:03:39,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157836275] [2022-04-07 13:03:39,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:03:39,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:03:39,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:03:39,471 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 13:03:39,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-07 13:03:39,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:03:39,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-07 13:03:39,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:03:39,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 13:03:39,801 INFO L272 TraceCheckUtils]: 0: Hoare triple {2398#true} call ULTIMATE.init(); {2398#true} is VALID [2022-04-07 13:03:39,801 INFO L290 TraceCheckUtils]: 1: Hoare triple {2398#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; {2398#true} is VALID [2022-04-07 13:03:39,801 INFO L290 TraceCheckUtils]: 2: Hoare triple {2398#true} assume true; {2398#true} is VALID [2022-04-07 13:03:39,802 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2398#true} {2398#true} #102#return; {2398#true} is VALID [2022-04-07 13:03:39,802 INFO L272 TraceCheckUtils]: 4: Hoare triple {2398#true} call #t~ret7 := main(); {2398#true} is VALID [2022-04-07 13:03:39,802 INFO L290 TraceCheckUtils]: 5: Hoare triple {2398#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {2398#true} is VALID [2022-04-07 13:03:39,802 INFO L272 TraceCheckUtils]: 6: Hoare triple {2398#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {2398#true} is VALID [2022-04-07 13:03:39,802 INFO L290 TraceCheckUtils]: 7: Hoare triple {2398#true} ~cond := #in~cond; {2398#true} is VALID [2022-04-07 13:03:39,802 INFO L290 TraceCheckUtils]: 8: Hoare triple {2398#true} assume !(0 == ~cond); {2398#true} is VALID [2022-04-07 13:03:39,802 INFO L290 TraceCheckUtils]: 9: Hoare triple {2398#true} assume true; {2398#true} is VALID [2022-04-07 13:03:39,802 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2398#true} {2398#true} #82#return; {2398#true} is VALID [2022-04-07 13:03:39,802 INFO L290 TraceCheckUtils]: 11: Hoare triple {2398#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {2407#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-07 13:03:39,803 INFO L290 TraceCheckUtils]: 12: Hoare triple {2407#(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; {2407#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-07 13:03:39,803 INFO L290 TraceCheckUtils]: 13: Hoare triple {2407#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !!(#t~post5 < 5);havoc #t~post5; {2407#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-07 13:03:39,804 INFO L290 TraceCheckUtils]: 14: Hoare triple {2407#(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; {2458#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-07 13:03:39,805 INFO L290 TraceCheckUtils]: 15: Hoare triple {2458#(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; {2458#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-07 13:03:39,805 INFO L290 TraceCheckUtils]: 16: Hoare triple {2458#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !!(#t~post5 < 5);havoc #t~post5; {2458#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-07 13:03:39,806 INFO L290 TraceCheckUtils]: 17: Hoare triple {2458#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {2468#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} is VALID [2022-04-07 13:03:39,806 INFO L290 TraceCheckUtils]: 18: Hoare triple {2468#(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; {2468#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} is VALID [2022-04-07 13:03:39,807 INFO L290 TraceCheckUtils]: 19: Hoare triple {2468#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} assume !!(#t~post6 < 5);havoc #t~post6; {2468#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} is VALID [2022-04-07 13:03:39,807 INFO L272 TraceCheckUtils]: 20: Hoare triple {2468#(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)); {2478#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 13:03:39,807 INFO L290 TraceCheckUtils]: 21: Hoare triple {2478#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2482#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 13:03:39,808 INFO L290 TraceCheckUtils]: 22: Hoare triple {2482#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2399#false} is VALID [2022-04-07 13:03:39,808 INFO L290 TraceCheckUtils]: 23: Hoare triple {2399#false} assume !false; {2399#false} is VALID [2022-04-07 13:03:39,808 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-07 13:03:39,808 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 13:03:40,038 INFO L290 TraceCheckUtils]: 23: Hoare triple {2399#false} assume !false; {2399#false} is VALID [2022-04-07 13:03:40,039 INFO L290 TraceCheckUtils]: 22: Hoare triple {2482#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2399#false} is VALID [2022-04-07 13:03:40,040 INFO L290 TraceCheckUtils]: 21: Hoare triple {2478#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2482#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 13:03:40,041 INFO L272 TraceCheckUtils]: 20: Hoare triple {2498#(< (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)); {2478#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 13:03:40,041 INFO L290 TraceCheckUtils]: 19: Hoare triple {2498#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} assume !!(#t~post6 < 5);havoc #t~post6; {2498#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} is VALID [2022-04-07 13:03:40,043 INFO L290 TraceCheckUtils]: 18: Hoare triple {2498#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2498#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} is VALID [2022-04-07 13:03:40,043 INFO L290 TraceCheckUtils]: 17: Hoare triple {2508#(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); {2498#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} is VALID [2022-04-07 13:03:40,044 INFO L290 TraceCheckUtils]: 16: Hoare triple {2508#(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 < 5);havoc #t~post5; {2508#(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-07 13:03:40,045 INFO L290 TraceCheckUtils]: 15: Hoare triple {2508#(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; {2508#(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-07 13:03:40,048 INFO L290 TraceCheckUtils]: 14: Hoare triple {2518#(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; {2508#(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-07 13:03:40,049 INFO L290 TraceCheckUtils]: 13: Hoare triple {2518#(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 < 5);havoc #t~post5; {2518#(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-07 13:03:40,049 INFO L290 TraceCheckUtils]: 12: Hoare triple {2518#(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; {2518#(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-07 13:03:40,060 INFO L290 TraceCheckUtils]: 11: Hoare triple {2398#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {2518#(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-07 13:03:40,061 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2398#true} {2398#true} #82#return; {2398#true} is VALID [2022-04-07 13:03:40,061 INFO L290 TraceCheckUtils]: 9: Hoare triple {2398#true} assume true; {2398#true} is VALID [2022-04-07 13:03:40,061 INFO L290 TraceCheckUtils]: 8: Hoare triple {2398#true} assume !(0 == ~cond); {2398#true} is VALID [2022-04-07 13:03:40,061 INFO L290 TraceCheckUtils]: 7: Hoare triple {2398#true} ~cond := #in~cond; {2398#true} is VALID [2022-04-07 13:03:40,061 INFO L272 TraceCheckUtils]: 6: Hoare triple {2398#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {2398#true} is VALID [2022-04-07 13:03:40,061 INFO L290 TraceCheckUtils]: 5: Hoare triple {2398#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {2398#true} is VALID [2022-04-07 13:03:40,061 INFO L272 TraceCheckUtils]: 4: Hoare triple {2398#true} call #t~ret7 := main(); {2398#true} is VALID [2022-04-07 13:03:40,061 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2398#true} {2398#true} #102#return; {2398#true} is VALID [2022-04-07 13:03:40,061 INFO L290 TraceCheckUtils]: 2: Hoare triple {2398#true} assume true; {2398#true} is VALID [2022-04-07 13:03:40,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {2398#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; {2398#true} is VALID [2022-04-07 13:03:40,061 INFO L272 TraceCheckUtils]: 0: Hoare triple {2398#true} call ULTIMATE.init(); {2398#true} is VALID [2022-04-07 13:03:40,062 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-07 13:03:40,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [157836275] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 13:03:40,062 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 13:03:40,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2022-04-07 13:03:40,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717198662] [2022-04-07 13:03:40,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 13:03:40,062 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-07 13:03:40,063 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:03:40,063 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-07 13:03:40,106 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:03:40,106 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-07 13:03:40,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:03:40,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-07 13:03:40,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-04-07 13:03:40,107 INFO L87 Difference]: Start difference. First operand 100 states and 141 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-07 13:03:45,832 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 13:03:47,842 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 13:03:49,844 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 13:03:51,898 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 13:03:53,900 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 13:03:55,954 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 13:03:58,038 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:04:00,114 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 13:04:02,142 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 13:04:10,282 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 13:04:12,298 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:04:15,082 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 13:04:17,566 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:04:20,741 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 13:04:22,771 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 13:04:24,996 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:04:32,009 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:04:40,119 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 13:04:47,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:04:47,862 INFO L93 Difference]: Finished difference Result 156 states and 225 transitions. [2022-04-07 13:04:47,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-07 13:04:47,863 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-07 13:04:47,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:04:47,863 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-07 13:04:47,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 144 transitions. [2022-04-07 13:04:47,865 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-07 13:04:47,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 144 transitions. [2022-04-07 13:04:47,867 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 144 transitions. [2022-04-07 13:04:48,498 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-07 13:04:48,501 INFO L225 Difference]: With dead ends: 156 [2022-04-07 13:04:48,501 INFO L226 Difference]: Without dead ends: 141 [2022-04-07 13:04:48,501 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-07 13:04:48,502 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 44 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 125 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 48.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 48.7s IncrementalHoareTripleChecker+Time [2022-04-07 13:04:48,502 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 171 Invalid, 726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 583 Invalid, 18 Unknown, 0 Unchecked, 48.7s Time] [2022-04-07 13:04:48,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-04-07 13:04:48,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 134. [2022-04-07 13:04:48,595 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:04:48,596 INFO L82 GeneralOperation]: Start isEquivalent. First operand 141 states. Second operand has 134 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 80 states have internal predecessors, (94), 49 states have call successors, (49), 11 states have call predecessors, (49), 10 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2022-04-07 13:04:48,596 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand has 134 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 80 states have internal predecessors, (94), 49 states have call successors, (49), 11 states have call predecessors, (49), 10 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2022-04-07 13:04:48,596 INFO L87 Difference]: Start difference. First operand 141 states. Second operand has 134 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 80 states have internal predecessors, (94), 49 states have call successors, (49), 11 states have call predecessors, (49), 10 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2022-04-07 13:04:48,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:04:48,600 INFO L93 Difference]: Finished difference Result 141 states and 199 transitions. [2022-04-07 13:04:48,600 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 199 transitions. [2022-04-07 13:04:48,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:04:48,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:04:48,601 INFO L74 IsIncluded]: Start isIncluded. First operand has 134 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 80 states have internal predecessors, (94), 49 states have call successors, (49), 11 states have call predecessors, (49), 10 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) Second operand 141 states. [2022-04-07 13:04:48,601 INFO L87 Difference]: Start difference. First operand has 134 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 80 states have internal predecessors, (94), 49 states have call successors, (49), 11 states have call predecessors, (49), 10 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) Second operand 141 states. [2022-04-07 13:04:48,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:04:48,605 INFO L93 Difference]: Finished difference Result 141 states and 199 transitions. [2022-04-07 13:04:48,605 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 199 transitions. [2022-04-07 13:04:48,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:04:48,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:04:48,606 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:04:48,606 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:04:48,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 80 states have internal predecessors, (94), 49 states have call successors, (49), 11 states have call predecessors, (49), 10 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2022-04-07 13:04:48,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 186 transitions. [2022-04-07 13:04:48,609 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 186 transitions. Word has length 24 [2022-04-07 13:04:48,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:04:48,610 INFO L478 AbstractCegarLoop]: Abstraction has 134 states and 186 transitions. [2022-04-07 13:04:48,610 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-07 13:04:48,610 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 186 transitions. [2022-04-07 13:04:48,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-07 13:04:48,610 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:04:48,610 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-07 13:04:48,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-07 13:04:48,823 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-07 13:04:48,823 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:04:48,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:04:48,824 INFO L85 PathProgramCache]: Analyzing trace with hash -45171523, now seen corresponding path program 1 times [2022-04-07 13:04:48,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:04:48,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090543720] [2022-04-07 13:04:48,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:04:48,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:04:48,832 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 13:04:48,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [844837066] [2022-04-07 13:04:48,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:04:48,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:04:48,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:04:48,846 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 13:04:48,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-07 13:04:48,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:04:48,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-07 13:04:48,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:04:48,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 13:04:49,075 INFO L272 TraceCheckUtils]: 0: Hoare triple {3295#true} call ULTIMATE.init(); {3295#true} is VALID [2022-04-07 13:04:49,075 INFO L290 TraceCheckUtils]: 1: Hoare triple {3295#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; {3295#true} is VALID [2022-04-07 13:04:49,075 INFO L290 TraceCheckUtils]: 2: Hoare triple {3295#true} assume true; {3295#true} is VALID [2022-04-07 13:04:49,075 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3295#true} {3295#true} #102#return; {3295#true} is VALID [2022-04-07 13:04:49,075 INFO L272 TraceCheckUtils]: 4: Hoare triple {3295#true} call #t~ret7 := main(); {3295#true} is VALID [2022-04-07 13:04:49,075 INFO L290 TraceCheckUtils]: 5: Hoare triple {3295#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {3295#true} is VALID [2022-04-07 13:04:49,075 INFO L272 TraceCheckUtils]: 6: Hoare triple {3295#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {3295#true} is VALID [2022-04-07 13:04:49,075 INFO L290 TraceCheckUtils]: 7: Hoare triple {3295#true} ~cond := #in~cond; {3295#true} is VALID [2022-04-07 13:04:49,075 INFO L290 TraceCheckUtils]: 8: Hoare triple {3295#true} assume !(0 == ~cond); {3295#true} is VALID [2022-04-07 13:04:49,075 INFO L290 TraceCheckUtils]: 9: Hoare triple {3295#true} assume true; {3295#true} is VALID [2022-04-07 13:04:49,075 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3295#true} {3295#true} #82#return; {3295#true} is VALID [2022-04-07 13:04:49,076 INFO L290 TraceCheckUtils]: 11: Hoare triple {3295#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {3333#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-07 13:04:49,076 INFO L290 TraceCheckUtils]: 12: Hoare triple {3333#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3333#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-07 13:04:49,077 INFO L290 TraceCheckUtils]: 13: Hoare triple {3333#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !!(#t~post5 < 5);havoc #t~post5; {3333#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-07 13:04:49,077 INFO L290 TraceCheckUtils]: 14: Hoare triple {3333#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {3333#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-07 13:04:49,078 INFO L290 TraceCheckUtils]: 15: Hoare triple {3333#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3333#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-07 13:04:49,078 INFO L290 TraceCheckUtils]: 16: Hoare triple {3333#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !!(#t~post6 < 5);havoc #t~post6; {3333#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-07 13:04:49,078 INFO L272 TraceCheckUtils]: 17: Hoare triple {3333#(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)); {3295#true} is VALID [2022-04-07 13:04:49,078 INFO L290 TraceCheckUtils]: 18: Hoare triple {3295#true} ~cond := #in~cond; {3295#true} is VALID [2022-04-07 13:04:49,078 INFO L290 TraceCheckUtils]: 19: Hoare triple {3295#true} assume !(0 == ~cond); {3295#true} is VALID [2022-04-07 13:04:49,079 INFO L290 TraceCheckUtils]: 20: Hoare triple {3295#true} assume true; {3295#true} is VALID [2022-04-07 13:04:49,079 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3295#true} {3333#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #84#return; {3333#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-07 13:04:49,079 INFO L272 TraceCheckUtils]: 22: Hoare triple {3333#(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)); {3295#true} is VALID [2022-04-07 13:04:49,079 INFO L290 TraceCheckUtils]: 23: Hoare triple {3295#true} ~cond := #in~cond; {3295#true} is VALID [2022-04-07 13:04:49,079 INFO L290 TraceCheckUtils]: 24: Hoare triple {3295#true} assume !(0 == ~cond); {3295#true} is VALID [2022-04-07 13:04:49,079 INFO L290 TraceCheckUtils]: 25: Hoare triple {3295#true} assume true; {3295#true} is VALID [2022-04-07 13:04:49,080 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3295#true} {3333#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #86#return; {3333#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-07 13:04:49,081 INFO L272 TraceCheckUtils]: 27: Hoare triple {3333#(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)); {3382#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 13:04:49,081 INFO L290 TraceCheckUtils]: 28: Hoare triple {3382#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3386#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 13:04:49,081 INFO L290 TraceCheckUtils]: 29: Hoare triple {3386#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3296#false} is VALID [2022-04-07 13:04:49,081 INFO L290 TraceCheckUtils]: 30: Hoare triple {3296#false} assume !false; {3296#false} is VALID [2022-04-07 13:04:49,081 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-07 13:04:49,081 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 13:04:49,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:04:49,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090543720] [2022-04-07 13:04:49,082 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 13:04:49,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [844837066] [2022-04-07 13:04:49,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [844837066] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 13:04:49,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 13:04:49,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 13:04:49,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559995978] [2022-04-07 13:04:49,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 13:04:49,082 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-07 13:04:49,082 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:04:49,082 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-07 13:04:49,104 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-07 13:04:49,104 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 13:04:49,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:04:49,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 13:04:49,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 13:04:49,104 INFO L87 Difference]: Start difference. First operand 134 states and 186 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-07 13:04:56,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:04:56,044 INFO L93 Difference]: Finished difference Result 140 states and 190 transitions. [2022-04-07 13:04:56,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 13:04:56,044 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-07 13:04:56,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:04:56,044 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-07 13:04:56,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-04-07 13:04:56,045 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-07 13:04:56,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-04-07 13:04:56,046 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 71 transitions. [2022-04-07 13:04:56,112 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-07 13:04:56,113 INFO L225 Difference]: With dead ends: 140 [2022-04-07 13:04:56,114 INFO L226 Difference]: Without dead ends: 116 [2022-04-07 13:04:56,114 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-07 13:04:56,114 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 6 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-04-07 13:04:56,115 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 154 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-04-07 13:04:56,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-04-07 13:04:56,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2022-04-07 13:04:56,151 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:04:56,152 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand has 116 states, 65 states have (on average 1.2769230769230768) internal successors, (83), 70 states have internal predecessors, (83), 42 states have call successors, (42), 9 states have call predecessors, (42), 8 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-07 13:04:56,152 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand has 116 states, 65 states have (on average 1.2769230769230768) internal successors, (83), 70 states have internal predecessors, (83), 42 states have call successors, (42), 9 states have call predecessors, (42), 8 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-07 13:04:56,152 INFO L87 Difference]: Start difference. First operand 116 states. Second operand has 116 states, 65 states have (on average 1.2769230769230768) internal successors, (83), 70 states have internal predecessors, (83), 42 states have call successors, (42), 9 states have call predecessors, (42), 8 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-07 13:04:56,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:04:56,155 INFO L93 Difference]: Finished difference Result 116 states and 162 transitions. [2022-04-07 13:04:56,155 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 162 transitions. [2022-04-07 13:04:56,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:04:56,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:04:56,156 INFO L74 IsIncluded]: Start isIncluded. First operand has 116 states, 65 states have (on average 1.2769230769230768) internal successors, (83), 70 states have internal predecessors, (83), 42 states have call successors, (42), 9 states have call predecessors, (42), 8 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) Second operand 116 states. [2022-04-07 13:04:56,156 INFO L87 Difference]: Start difference. First operand has 116 states, 65 states have (on average 1.2769230769230768) internal successors, (83), 70 states have internal predecessors, (83), 42 states have call successors, (42), 9 states have call predecessors, (42), 8 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) Second operand 116 states. [2022-04-07 13:04:56,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:04:56,159 INFO L93 Difference]: Finished difference Result 116 states and 162 transitions. [2022-04-07 13:04:56,159 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 162 transitions. [2022-04-07 13:04:56,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:04:56,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:04:56,159 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:04:56,159 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:04:56,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 65 states have (on average 1.2769230769230768) internal successors, (83), 70 states have internal predecessors, (83), 42 states have call successors, (42), 9 states have call predecessors, (42), 8 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-07 13:04:56,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 162 transitions. [2022-04-07 13:04:56,162 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 162 transitions. Word has length 31 [2022-04-07 13:04:56,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:04:56,163 INFO L478 AbstractCegarLoop]: Abstraction has 116 states and 162 transitions. [2022-04-07 13:04:56,163 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-07 13:04:56,163 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 162 transitions. [2022-04-07 13:04:56,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-07 13:04:56,164 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:04:56,164 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-07 13:04:56,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-07 13:04:56,367 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-07 13:04:56,367 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:04:56,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:04:56,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1547125783, now seen corresponding path program 1 times [2022-04-07 13:04:56,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:04:56,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113046024] [2022-04-07 13:04:56,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:04:56,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:04:56,376 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 13:04:56,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [445856570] [2022-04-07 13:04:56,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:04:56,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:04:56,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:04:56,377 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 13:04:56,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-07 13:04:56,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:04:56,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 13:04:56,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:04:56,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 13:04:56,585 INFO L272 TraceCheckUtils]: 0: Hoare triple {4004#true} call ULTIMATE.init(); {4004#true} is VALID [2022-04-07 13:04:56,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {4004#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; {4004#true} is VALID [2022-04-07 13:04:56,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {4004#true} assume true; {4004#true} is VALID [2022-04-07 13:04:56,586 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4004#true} {4004#true} #102#return; {4004#true} is VALID [2022-04-07 13:04:56,586 INFO L272 TraceCheckUtils]: 4: Hoare triple {4004#true} call #t~ret7 := main(); {4004#true} is VALID [2022-04-07 13:04:56,586 INFO L290 TraceCheckUtils]: 5: Hoare triple {4004#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {4004#true} is VALID [2022-04-07 13:04:56,586 INFO L272 TraceCheckUtils]: 6: Hoare triple {4004#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {4004#true} is VALID [2022-04-07 13:04:56,586 INFO L290 TraceCheckUtils]: 7: Hoare triple {4004#true} ~cond := #in~cond; {4004#true} is VALID [2022-04-07 13:04:56,586 INFO L290 TraceCheckUtils]: 8: Hoare triple {4004#true} assume !(0 == ~cond); {4004#true} is VALID [2022-04-07 13:04:56,586 INFO L290 TraceCheckUtils]: 9: Hoare triple {4004#true} assume true; {4004#true} is VALID [2022-04-07 13:04:56,586 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4004#true} {4004#true} #82#return; {4004#true} is VALID [2022-04-07 13:04:56,587 INFO L290 TraceCheckUtils]: 11: Hoare triple {4004#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {4042#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-07 13:04:56,588 INFO L290 TraceCheckUtils]: 12: Hoare triple {4042#(and (= main_~p~0 0) (= main_~h~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4042#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-07 13:04:56,588 INFO L290 TraceCheckUtils]: 13: Hoare triple {4042#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(#t~post5 < 5);havoc #t~post5; {4042#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-07 13:04:56,589 INFO L290 TraceCheckUtils]: 14: Hoare triple {4042#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {4042#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-07 13:04:56,589 INFO L290 TraceCheckUtils]: 15: Hoare triple {4042#(and (= main_~p~0 0) (= main_~h~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4042#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-07 13:04:56,589 INFO L290 TraceCheckUtils]: 16: Hoare triple {4042#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(#t~post5 < 5);havoc #t~post5; {4042#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-07 13:04:56,590 INFO L290 TraceCheckUtils]: 17: Hoare triple {4042#(and (= main_~p~0 0) (= main_~h~0 0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {4042#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-07 13:04:56,590 INFO L290 TraceCheckUtils]: 18: Hoare triple {4042#(and (= main_~p~0 0) (= main_~h~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4042#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-07 13:04:56,590 INFO L290 TraceCheckUtils]: 19: Hoare triple {4042#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(#t~post6 < 5);havoc #t~post6; {4042#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-07 13:04:56,590 INFO L272 TraceCheckUtils]: 20: Hoare triple {4042#(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)); {4004#true} is VALID [2022-04-07 13:04:56,590 INFO L290 TraceCheckUtils]: 21: Hoare triple {4004#true} ~cond := #in~cond; {4004#true} is VALID [2022-04-07 13:04:56,590 INFO L290 TraceCheckUtils]: 22: Hoare triple {4004#true} assume !(0 == ~cond); {4004#true} is VALID [2022-04-07 13:04:56,590 INFO L290 TraceCheckUtils]: 23: Hoare triple {4004#true} assume true; {4004#true} is VALID [2022-04-07 13:04:56,591 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {4004#true} {4042#(and (= main_~p~0 0) (= main_~h~0 0))} #84#return; {4042#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-07 13:04:56,591 INFO L272 TraceCheckUtils]: 25: Hoare triple {4042#(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)); {4004#true} is VALID [2022-04-07 13:04:56,591 INFO L290 TraceCheckUtils]: 26: Hoare triple {4004#true} ~cond := #in~cond; {4004#true} is VALID [2022-04-07 13:04:56,591 INFO L290 TraceCheckUtils]: 27: Hoare triple {4004#true} assume !(0 == ~cond); {4004#true} is VALID [2022-04-07 13:04:56,591 INFO L290 TraceCheckUtils]: 28: Hoare triple {4004#true} assume true; {4004#true} is VALID [2022-04-07 13:04:56,592 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {4004#true} {4042#(and (= main_~p~0 0) (= main_~h~0 0))} #86#return; {4042#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-07 13:04:56,593 INFO L272 TraceCheckUtils]: 30: Hoare triple {4042#(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)); {4100#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 13:04:56,593 INFO L290 TraceCheckUtils]: 31: Hoare triple {4100#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4104#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 13:04:56,593 INFO L290 TraceCheckUtils]: 32: Hoare triple {4104#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4005#false} is VALID [2022-04-07 13:04:56,593 INFO L290 TraceCheckUtils]: 33: Hoare triple {4005#false} assume !false; {4005#false} is VALID [2022-04-07 13:04:56,594 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-07 13:04:56,594 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 13:04:56,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:04:56,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113046024] [2022-04-07 13:04:56,594 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 13:04:56,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445856570] [2022-04-07 13:04:56,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445856570] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 13:04:56,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 13:04:56,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 13:04:56,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798934420] [2022-04-07 13:04:56,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 13:04:56,594 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-07 13:04:56,595 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:04:56,596 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-07 13:04:56,618 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-07 13:04:56,618 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 13:04:56,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:04:56,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 13:04:56,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 13:04:56,619 INFO L87 Difference]: Start difference. First operand 116 states and 162 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-07 13:05:04,344 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 13:05:06,350 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 13:05:06,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:05:06,539 INFO L93 Difference]: Finished difference Result 138 states and 180 transitions. [2022-04-07 13:05:06,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 13:05:06,539 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-07 13:05:06,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:05:06,539 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-07 13:05:06,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-04-07 13:05:06,540 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-07 13:05:06,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-04-07 13:05:06,548 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 69 transitions. [2022-04-07 13:05:06,617 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:05:06,631 INFO L225 Difference]: With dead ends: 138 [2022-04-07 13:05:06,631 INFO L226 Difference]: Without dead ends: 134 [2022-04-07 13:05:06,631 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-07 13:05:06,632 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 8 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-04-07 13:05:06,632 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 156 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 2 Unknown, 0 Unchecked, 4.5s Time] [2022-04-07 13:05:06,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-04-07 13:05:06,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 131. [2022-04-07 13:05:06,693 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:05:06,693 INFO L82 GeneralOperation]: Start isEquivalent. First operand 134 states. Second operand has 131 states, 77 states have (on average 1.155844155844156) internal successors, (89), 80 states have internal predecessors, (89), 40 states have call successors, (40), 14 states have call predecessors, (40), 13 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-07 13:05:06,693 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand has 131 states, 77 states have (on average 1.155844155844156) internal successors, (89), 80 states have internal predecessors, (89), 40 states have call successors, (40), 14 states have call predecessors, (40), 13 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-07 13:05:06,694 INFO L87 Difference]: Start difference. First operand 134 states. Second operand has 131 states, 77 states have (on average 1.155844155844156) internal successors, (89), 80 states have internal predecessors, (89), 40 states have call successors, (40), 14 states have call predecessors, (40), 13 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-07 13:05:06,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:05:06,697 INFO L93 Difference]: Finished difference Result 134 states and 170 transitions. [2022-04-07 13:05:06,697 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 170 transitions. [2022-04-07 13:05:06,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:05:06,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:05:06,697 INFO L74 IsIncluded]: Start isIncluded. First operand has 131 states, 77 states have (on average 1.155844155844156) internal successors, (89), 80 states have internal predecessors, (89), 40 states have call successors, (40), 14 states have call predecessors, (40), 13 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) Second operand 134 states. [2022-04-07 13:05:06,698 INFO L87 Difference]: Start difference. First operand has 131 states, 77 states have (on average 1.155844155844156) internal successors, (89), 80 states have internal predecessors, (89), 40 states have call successors, (40), 14 states have call predecessors, (40), 13 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) Second operand 134 states. [2022-04-07 13:05:06,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:05:06,700 INFO L93 Difference]: Finished difference Result 134 states and 170 transitions. [2022-04-07 13:05:06,700 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 170 transitions. [2022-04-07 13:05:06,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:05:06,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:05:06,700 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:05:06,700 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:05:06,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 77 states have (on average 1.155844155844156) internal successors, (89), 80 states have internal predecessors, (89), 40 states have call successors, (40), 14 states have call predecessors, (40), 13 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-07 13:05:06,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 166 transitions. [2022-04-07 13:05:06,703 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 166 transitions. Word has length 34 [2022-04-07 13:05:06,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:05:06,703 INFO L478 AbstractCegarLoop]: Abstraction has 131 states and 166 transitions. [2022-04-07 13:05:06,703 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-07 13:05:06,703 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 166 transitions. [2022-04-07 13:05:06,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-07 13:05:06,703 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:05:06,704 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-07 13:05:06,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-07 13:05:06,909 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-07 13:05:06,910 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:05:06,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:05:06,910 INFO L85 PathProgramCache]: Analyzing trace with hash 821435566, now seen corresponding path program 1 times [2022-04-07 13:05:06,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:05:06,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008419844] [2022-04-07 13:05:06,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:05:06,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:05:06,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:05:07,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 13:05:07,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:05:07,040 INFO L290 TraceCheckUtils]: 0: Hoare triple {4784#(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; {4774#(<= ~counter~0 0)} is VALID [2022-04-07 13:05:07,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {4774#(<= ~counter~0 0)} assume true; {4774#(<= ~counter~0 0)} is VALID [2022-04-07 13:05:07,041 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4774#(<= ~counter~0 0)} {4769#true} #102#return; {4774#(<= ~counter~0 0)} is VALID [2022-04-07 13:05:07,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-07 13:05:07,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:05:07,046 INFO L290 TraceCheckUtils]: 0: Hoare triple {4769#true} ~cond := #in~cond; {4769#true} is VALID [2022-04-07 13:05:07,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {4769#true} assume !(0 == ~cond); {4769#true} is VALID [2022-04-07 13:05:07,046 INFO L290 TraceCheckUtils]: 2: Hoare triple {4769#true} assume true; {4769#true} is VALID [2022-04-07 13:05:07,046 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4769#true} {4774#(<= ~counter~0 0)} #82#return; {4774#(<= ~counter~0 0)} is VALID [2022-04-07 13:05:07,047 INFO L272 TraceCheckUtils]: 0: Hoare triple {4769#true} call ULTIMATE.init(); {4784#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 13:05:07,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {4784#(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; {4774#(<= ~counter~0 0)} is VALID [2022-04-07 13:05:07,048 INFO L290 TraceCheckUtils]: 2: Hoare triple {4774#(<= ~counter~0 0)} assume true; {4774#(<= ~counter~0 0)} is VALID [2022-04-07 13:05:07,048 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4774#(<= ~counter~0 0)} {4769#true} #102#return; {4774#(<= ~counter~0 0)} is VALID [2022-04-07 13:05:07,048 INFO L272 TraceCheckUtils]: 4: Hoare triple {4774#(<= ~counter~0 0)} call #t~ret7 := main(); {4774#(<= ~counter~0 0)} is VALID [2022-04-07 13:05:07,048 INFO L290 TraceCheckUtils]: 5: Hoare triple {4774#(<= ~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; {4774#(<= ~counter~0 0)} is VALID [2022-04-07 13:05:07,048 INFO L272 TraceCheckUtils]: 6: Hoare triple {4774#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {4769#true} is VALID [2022-04-07 13:05:07,049 INFO L290 TraceCheckUtils]: 7: Hoare triple {4769#true} ~cond := #in~cond; {4769#true} is VALID [2022-04-07 13:05:07,049 INFO L290 TraceCheckUtils]: 8: Hoare triple {4769#true} assume !(0 == ~cond); {4769#true} is VALID [2022-04-07 13:05:07,049 INFO L290 TraceCheckUtils]: 9: Hoare triple {4769#true} assume true; {4769#true} is VALID [2022-04-07 13:05:07,049 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4769#true} {4774#(<= ~counter~0 0)} #82#return; {4774#(<= ~counter~0 0)} is VALID [2022-04-07 13:05:07,049 INFO L290 TraceCheckUtils]: 11: Hoare triple {4774#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {4774#(<= ~counter~0 0)} is VALID [2022-04-07 13:05:07,050 INFO L290 TraceCheckUtils]: 12: Hoare triple {4774#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4779#(<= ~counter~0 1)} is VALID [2022-04-07 13:05:07,050 INFO L290 TraceCheckUtils]: 13: Hoare triple {4779#(<= ~counter~0 1)} assume !!(#t~post5 < 5);havoc #t~post5; {4779#(<= ~counter~0 1)} is VALID [2022-04-07 13:05:07,050 INFO L290 TraceCheckUtils]: 14: Hoare triple {4779#(<= ~counter~0 1)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {4779#(<= ~counter~0 1)} is VALID [2022-04-07 13:05:07,051 INFO L290 TraceCheckUtils]: 15: Hoare triple {4779#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4780#(<= ~counter~0 2)} is VALID [2022-04-07 13:05:07,052 INFO L290 TraceCheckUtils]: 16: Hoare triple {4780#(<= ~counter~0 2)} assume !!(#t~post5 < 5);havoc #t~post5; {4780#(<= ~counter~0 2)} is VALID [2022-04-07 13:05:07,052 INFO L290 TraceCheckUtils]: 17: Hoare triple {4780#(<= ~counter~0 2)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {4780#(<= ~counter~0 2)} is VALID [2022-04-07 13:05:07,052 INFO L290 TraceCheckUtils]: 18: Hoare triple {4780#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4781#(<= ~counter~0 3)} is VALID [2022-04-07 13:05:07,053 INFO L290 TraceCheckUtils]: 19: Hoare triple {4781#(<= ~counter~0 3)} assume !!(#t~post5 < 5);havoc #t~post5; {4781#(<= ~counter~0 3)} is VALID [2022-04-07 13:05:07,053 INFO L290 TraceCheckUtils]: 20: Hoare triple {4781#(<= ~counter~0 3)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {4781#(<= ~counter~0 3)} is VALID [2022-04-07 13:05:07,053 INFO L290 TraceCheckUtils]: 21: Hoare triple {4781#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4782#(<= ~counter~0 4)} is VALID [2022-04-07 13:05:07,054 INFO L290 TraceCheckUtils]: 22: Hoare triple {4782#(<= ~counter~0 4)} assume !!(#t~post5 < 5);havoc #t~post5; {4782#(<= ~counter~0 4)} is VALID [2022-04-07 13:05:07,054 INFO L290 TraceCheckUtils]: 23: Hoare triple {4782#(<= ~counter~0 4)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {4782#(<= ~counter~0 4)} is VALID [2022-04-07 13:05:07,054 INFO L290 TraceCheckUtils]: 24: Hoare triple {4782#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4783#(<= |main_#t~post5| 4)} is VALID [2022-04-07 13:05:07,055 INFO L290 TraceCheckUtils]: 25: Hoare triple {4783#(<= |main_#t~post5| 4)} assume !(#t~post5 < 5);havoc #t~post5; {4770#false} is VALID [2022-04-07 13:05:07,055 INFO L290 TraceCheckUtils]: 26: Hoare triple {4770#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4770#false} is VALID [2022-04-07 13:05:07,055 INFO L290 TraceCheckUtils]: 27: Hoare triple {4770#false} assume !!(#t~post6 < 5);havoc #t~post6; {4770#false} is VALID [2022-04-07 13:05:07,055 INFO L272 TraceCheckUtils]: 28: Hoare triple {4770#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {4770#false} is VALID [2022-04-07 13:05:07,055 INFO L290 TraceCheckUtils]: 29: Hoare triple {4770#false} ~cond := #in~cond; {4770#false} is VALID [2022-04-07 13:05:07,055 INFO L290 TraceCheckUtils]: 30: Hoare triple {4770#false} assume 0 == ~cond; {4770#false} is VALID [2022-04-07 13:05:07,056 INFO L290 TraceCheckUtils]: 31: Hoare triple {4770#false} assume !false; {4770#false} is VALID [2022-04-07 13:05:07,056 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-07 13:05:07,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:05:07,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008419844] [2022-04-07 13:05:07,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008419844] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 13:05:07,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1359415991] [2022-04-07 13:05:07,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:05:07,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:05:07,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:05:07,057 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 13:05:07,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-07 13:05:07,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:05:07,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-07 13:05:07,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:05:07,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 13:05:07,305 INFO L272 TraceCheckUtils]: 0: Hoare triple {4769#true} call ULTIMATE.init(); {4769#true} is VALID [2022-04-07 13:05:07,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {4769#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; {4774#(<= ~counter~0 0)} is VALID [2022-04-07 13:05:07,306 INFO L290 TraceCheckUtils]: 2: Hoare triple {4774#(<= ~counter~0 0)} assume true; {4774#(<= ~counter~0 0)} is VALID [2022-04-07 13:05:07,306 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4774#(<= ~counter~0 0)} {4769#true} #102#return; {4774#(<= ~counter~0 0)} is VALID [2022-04-07 13:05:07,311 INFO L272 TraceCheckUtils]: 4: Hoare triple {4774#(<= ~counter~0 0)} call #t~ret7 := main(); {4774#(<= ~counter~0 0)} is VALID [2022-04-07 13:05:07,311 INFO L290 TraceCheckUtils]: 5: Hoare triple {4774#(<= ~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; {4774#(<= ~counter~0 0)} is VALID [2022-04-07 13:05:07,311 INFO L272 TraceCheckUtils]: 6: Hoare triple {4774#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {4774#(<= ~counter~0 0)} is VALID [2022-04-07 13:05:07,312 INFO L290 TraceCheckUtils]: 7: Hoare triple {4774#(<= ~counter~0 0)} ~cond := #in~cond; {4774#(<= ~counter~0 0)} is VALID [2022-04-07 13:05:07,312 INFO L290 TraceCheckUtils]: 8: Hoare triple {4774#(<= ~counter~0 0)} assume !(0 == ~cond); {4774#(<= ~counter~0 0)} is VALID [2022-04-07 13:05:07,312 INFO L290 TraceCheckUtils]: 9: Hoare triple {4774#(<= ~counter~0 0)} assume true; {4774#(<= ~counter~0 0)} is VALID [2022-04-07 13:05:07,313 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4774#(<= ~counter~0 0)} {4774#(<= ~counter~0 0)} #82#return; {4774#(<= ~counter~0 0)} is VALID [2022-04-07 13:05:07,313 INFO L290 TraceCheckUtils]: 11: Hoare triple {4774#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {4774#(<= ~counter~0 0)} is VALID [2022-04-07 13:05:07,314 INFO L290 TraceCheckUtils]: 12: Hoare triple {4774#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4779#(<= ~counter~0 1)} is VALID [2022-04-07 13:05:07,314 INFO L290 TraceCheckUtils]: 13: Hoare triple {4779#(<= ~counter~0 1)} assume !!(#t~post5 < 5);havoc #t~post5; {4779#(<= ~counter~0 1)} is VALID [2022-04-07 13:05:07,314 INFO L290 TraceCheckUtils]: 14: Hoare triple {4779#(<= ~counter~0 1)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {4779#(<= ~counter~0 1)} is VALID [2022-04-07 13:05:07,315 INFO L290 TraceCheckUtils]: 15: Hoare triple {4779#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4780#(<= ~counter~0 2)} is VALID [2022-04-07 13:05:07,315 INFO L290 TraceCheckUtils]: 16: Hoare triple {4780#(<= ~counter~0 2)} assume !!(#t~post5 < 5);havoc #t~post5; {4780#(<= ~counter~0 2)} is VALID [2022-04-07 13:05:07,315 INFO L290 TraceCheckUtils]: 17: Hoare triple {4780#(<= ~counter~0 2)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {4780#(<= ~counter~0 2)} is VALID [2022-04-07 13:05:07,316 INFO L290 TraceCheckUtils]: 18: Hoare triple {4780#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4781#(<= ~counter~0 3)} is VALID [2022-04-07 13:05:07,316 INFO L290 TraceCheckUtils]: 19: Hoare triple {4781#(<= ~counter~0 3)} assume !!(#t~post5 < 5);havoc #t~post5; {4781#(<= ~counter~0 3)} is VALID [2022-04-07 13:05:07,316 INFO L290 TraceCheckUtils]: 20: Hoare triple {4781#(<= ~counter~0 3)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {4781#(<= ~counter~0 3)} is VALID [2022-04-07 13:05:07,317 INFO L290 TraceCheckUtils]: 21: Hoare triple {4781#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4782#(<= ~counter~0 4)} is VALID [2022-04-07 13:05:07,317 INFO L290 TraceCheckUtils]: 22: Hoare triple {4782#(<= ~counter~0 4)} assume !!(#t~post5 < 5);havoc #t~post5; {4782#(<= ~counter~0 4)} is VALID [2022-04-07 13:05:07,317 INFO L290 TraceCheckUtils]: 23: Hoare triple {4782#(<= ~counter~0 4)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {4782#(<= ~counter~0 4)} is VALID [2022-04-07 13:05:07,317 INFO L290 TraceCheckUtils]: 24: Hoare triple {4782#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4783#(<= |main_#t~post5| 4)} is VALID [2022-04-07 13:05:07,318 INFO L290 TraceCheckUtils]: 25: Hoare triple {4783#(<= |main_#t~post5| 4)} assume !(#t~post5 < 5);havoc #t~post5; {4770#false} is VALID [2022-04-07 13:05:07,318 INFO L290 TraceCheckUtils]: 26: Hoare triple {4770#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4770#false} is VALID [2022-04-07 13:05:07,318 INFO L290 TraceCheckUtils]: 27: Hoare triple {4770#false} assume !!(#t~post6 < 5);havoc #t~post6; {4770#false} is VALID [2022-04-07 13:05:07,318 INFO L272 TraceCheckUtils]: 28: Hoare triple {4770#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {4770#false} is VALID [2022-04-07 13:05:07,318 INFO L290 TraceCheckUtils]: 29: Hoare triple {4770#false} ~cond := #in~cond; {4770#false} is VALID [2022-04-07 13:05:07,318 INFO L290 TraceCheckUtils]: 30: Hoare triple {4770#false} assume 0 == ~cond; {4770#false} is VALID [2022-04-07 13:05:07,318 INFO L290 TraceCheckUtils]: 31: Hoare triple {4770#false} assume !false; {4770#false} is VALID [2022-04-07 13:05:07,318 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-07 13:05:07,318 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 13:05:07,507 INFO L290 TraceCheckUtils]: 31: Hoare triple {4770#false} assume !false; {4770#false} is VALID [2022-04-07 13:05:07,507 INFO L290 TraceCheckUtils]: 30: Hoare triple {4770#false} assume 0 == ~cond; {4770#false} is VALID [2022-04-07 13:05:07,507 INFO L290 TraceCheckUtils]: 29: Hoare triple {4770#false} ~cond := #in~cond; {4770#false} is VALID [2022-04-07 13:05:07,508 INFO L272 TraceCheckUtils]: 28: Hoare triple {4770#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {4770#false} is VALID [2022-04-07 13:05:07,508 INFO L290 TraceCheckUtils]: 27: Hoare triple {4770#false} assume !!(#t~post6 < 5);havoc #t~post6; {4770#false} is VALID [2022-04-07 13:05:07,508 INFO L290 TraceCheckUtils]: 26: Hoare triple {4770#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4770#false} is VALID [2022-04-07 13:05:07,508 INFO L290 TraceCheckUtils]: 25: Hoare triple {4783#(<= |main_#t~post5| 4)} assume !(#t~post5 < 5);havoc #t~post5; {4770#false} is VALID [2022-04-07 13:05:07,508 INFO L290 TraceCheckUtils]: 24: Hoare triple {4782#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4783#(<= |main_#t~post5| 4)} is VALID [2022-04-07 13:05:07,508 INFO L290 TraceCheckUtils]: 23: Hoare triple {4782#(<= ~counter~0 4)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {4782#(<= ~counter~0 4)} is VALID [2022-04-07 13:05:07,509 INFO L290 TraceCheckUtils]: 22: Hoare triple {4782#(<= ~counter~0 4)} assume !!(#t~post5 < 5);havoc #t~post5; {4782#(<= ~counter~0 4)} is VALID [2022-04-07 13:05:07,509 INFO L290 TraceCheckUtils]: 21: Hoare triple {4781#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4782#(<= ~counter~0 4)} is VALID [2022-04-07 13:05:07,510 INFO L290 TraceCheckUtils]: 20: Hoare triple {4781#(<= ~counter~0 3)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {4781#(<= ~counter~0 3)} is VALID [2022-04-07 13:05:07,510 INFO L290 TraceCheckUtils]: 19: Hoare triple {4781#(<= ~counter~0 3)} assume !!(#t~post5 < 5);havoc #t~post5; {4781#(<= ~counter~0 3)} is VALID [2022-04-07 13:05:07,510 INFO L290 TraceCheckUtils]: 18: Hoare triple {4780#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4781#(<= ~counter~0 3)} is VALID [2022-04-07 13:05:07,510 INFO L290 TraceCheckUtils]: 17: Hoare triple {4780#(<= ~counter~0 2)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {4780#(<= ~counter~0 2)} is VALID [2022-04-07 13:05:07,511 INFO L290 TraceCheckUtils]: 16: Hoare triple {4780#(<= ~counter~0 2)} assume !!(#t~post5 < 5);havoc #t~post5; {4780#(<= ~counter~0 2)} is VALID [2022-04-07 13:05:07,512 INFO L290 TraceCheckUtils]: 15: Hoare triple {4779#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4780#(<= ~counter~0 2)} is VALID [2022-04-07 13:05:07,512 INFO L290 TraceCheckUtils]: 14: Hoare triple {4779#(<= ~counter~0 1)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {4779#(<= ~counter~0 1)} is VALID [2022-04-07 13:05:07,518 INFO L290 TraceCheckUtils]: 13: Hoare triple {4779#(<= ~counter~0 1)} assume !!(#t~post5 < 5);havoc #t~post5; {4779#(<= ~counter~0 1)} is VALID [2022-04-07 13:05:07,518 INFO L290 TraceCheckUtils]: 12: Hoare triple {4774#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4779#(<= ~counter~0 1)} is VALID [2022-04-07 13:05:07,519 INFO L290 TraceCheckUtils]: 11: Hoare triple {4774#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {4774#(<= ~counter~0 0)} is VALID [2022-04-07 13:05:07,519 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4769#true} {4774#(<= ~counter~0 0)} #82#return; {4774#(<= ~counter~0 0)} is VALID [2022-04-07 13:05:07,519 INFO L290 TraceCheckUtils]: 9: Hoare triple {4769#true} assume true; {4769#true} is VALID [2022-04-07 13:05:07,519 INFO L290 TraceCheckUtils]: 8: Hoare triple {4769#true} assume !(0 == ~cond); {4769#true} is VALID [2022-04-07 13:05:07,519 INFO L290 TraceCheckUtils]: 7: Hoare triple {4769#true} ~cond := #in~cond; {4769#true} is VALID [2022-04-07 13:05:07,519 INFO L272 TraceCheckUtils]: 6: Hoare triple {4774#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {4769#true} is VALID [2022-04-07 13:05:07,519 INFO L290 TraceCheckUtils]: 5: Hoare triple {4774#(<= ~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; {4774#(<= ~counter~0 0)} is VALID [2022-04-07 13:05:07,520 INFO L272 TraceCheckUtils]: 4: Hoare triple {4774#(<= ~counter~0 0)} call #t~ret7 := main(); {4774#(<= ~counter~0 0)} is VALID [2022-04-07 13:05:07,520 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4774#(<= ~counter~0 0)} {4769#true} #102#return; {4774#(<= ~counter~0 0)} is VALID [2022-04-07 13:05:07,520 INFO L290 TraceCheckUtils]: 2: Hoare triple {4774#(<= ~counter~0 0)} assume true; {4774#(<= ~counter~0 0)} is VALID [2022-04-07 13:05:07,521 INFO L290 TraceCheckUtils]: 1: Hoare triple {4769#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; {4774#(<= ~counter~0 0)} is VALID [2022-04-07 13:05:07,521 INFO L272 TraceCheckUtils]: 0: Hoare triple {4769#true} call ULTIMATE.init(); {4769#true} is VALID [2022-04-07 13:05:07,521 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-07 13:05:07,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1359415991] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 13:05:07,521 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 13:05:07,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 9 [2022-04-07 13:05:07,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662889500] [2022-04-07 13:05:07,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 13:05:07,522 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2022-04-07 13:05:07,522 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:05:07,522 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 13:05:07,545 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:05:07,546 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-07 13:05:07,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:05:07,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-07 13:05:07,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-04-07 13:05:07,546 INFO L87 Difference]: Start difference. First operand 131 states and 166 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 13:05:12,416 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:05:16,718 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:05:19,695 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 13:05:22,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:05:22,169 INFO L93 Difference]: Finished difference Result 185 states and 233 transitions. [2022-04-07 13:05:22,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-07 13:05:22,169 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2022-04-07 13:05:22,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:05:22,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 13:05:22,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 127 transitions. [2022-04-07 13:05:22,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 13:05:22,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 127 transitions. [2022-04-07 13:05:22,172 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 127 transitions. [2022-04-07 13:05:22,296 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:05:22,298 INFO L225 Difference]: With dead ends: 185 [2022-04-07 13:05:22,298 INFO L226 Difference]: Without dead ends: 145 [2022-04-07 13:05:22,299 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2022-04-07 13:05:22,299 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 61 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 44 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.3s IncrementalHoareTripleChecker+Time [2022-04-07 13:05:22,300 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 121 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 143 Invalid, 3 Unknown, 0 Unchecked, 11.3s Time] [2022-04-07 13:05:22,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-04-07 13:05:22,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 142. [2022-04-07 13:05:22,359 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:05:22,359 INFO L82 GeneralOperation]: Start isEquivalent. First operand 145 states. Second operand has 142 states, 86 states have (on average 1.1627906976744187) internal successors, (100), 89 states have internal predecessors, (100), 40 states have call successors, (40), 16 states have call predecessors, (40), 15 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-07 13:05:22,359 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand has 142 states, 86 states have (on average 1.1627906976744187) internal successors, (100), 89 states have internal predecessors, (100), 40 states have call successors, (40), 16 states have call predecessors, (40), 15 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-07 13:05:22,360 INFO L87 Difference]: Start difference. First operand 145 states. Second operand has 142 states, 86 states have (on average 1.1627906976744187) internal successors, (100), 89 states have internal predecessors, (100), 40 states have call successors, (40), 16 states have call predecessors, (40), 15 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-07 13:05:22,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:05:22,362 INFO L93 Difference]: Finished difference Result 145 states and 179 transitions. [2022-04-07 13:05:22,362 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 179 transitions. [2022-04-07 13:05:22,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:05:22,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:05:22,363 INFO L74 IsIncluded]: Start isIncluded. First operand has 142 states, 86 states have (on average 1.1627906976744187) internal successors, (100), 89 states have internal predecessors, (100), 40 states have call successors, (40), 16 states have call predecessors, (40), 15 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) Second operand 145 states. [2022-04-07 13:05:22,363 INFO L87 Difference]: Start difference. First operand has 142 states, 86 states have (on average 1.1627906976744187) internal successors, (100), 89 states have internal predecessors, (100), 40 states have call successors, (40), 16 states have call predecessors, (40), 15 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) Second operand 145 states. [2022-04-07 13:05:22,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:05:22,365 INFO L93 Difference]: Finished difference Result 145 states and 179 transitions. [2022-04-07 13:05:22,365 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 179 transitions. [2022-04-07 13:05:22,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:05:22,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:05:22,366 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:05:22,366 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:05:22,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 86 states have (on average 1.1627906976744187) internal successors, (100), 89 states have internal predecessors, (100), 40 states have call successors, (40), 16 states have call predecessors, (40), 15 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-07 13:05:22,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 177 transitions. [2022-04-07 13:05:22,369 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 177 transitions. Word has length 32 [2022-04-07 13:05:22,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:05:22,369 INFO L478 AbstractCegarLoop]: Abstraction has 142 states and 177 transitions. [2022-04-07 13:05:22,369 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 13:05:22,369 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 177 transitions. [2022-04-07 13:05:22,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-07 13:05:22,369 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:05:22,369 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 13:05:22,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-07 13:05:22,583 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-07 13:05:22,583 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:05:22,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:05:22,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1505493762, now seen corresponding path program 2 times [2022-04-07 13:05:22,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:05:22,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378053117] [2022-04-07 13:05:22,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:05:22,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:05:22,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:05:22,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 13:05:22,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:05:22,658 INFO L290 TraceCheckUtils]: 0: Hoare triple {5763#(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; {5751#true} is VALID [2022-04-07 13:05:22,658 INFO L290 TraceCheckUtils]: 1: Hoare triple {5751#true} assume true; {5751#true} is VALID [2022-04-07 13:05:22,658 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5751#true} {5751#true} #102#return; {5751#true} is VALID [2022-04-07 13:05:22,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-07 13:05:22,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:05:22,661 INFO L290 TraceCheckUtils]: 0: Hoare triple {5751#true} ~cond := #in~cond; {5751#true} is VALID [2022-04-07 13:05:22,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {5751#true} assume !(0 == ~cond); {5751#true} is VALID [2022-04-07 13:05:22,662 INFO L290 TraceCheckUtils]: 2: Hoare triple {5751#true} assume true; {5751#true} is VALID [2022-04-07 13:05:22,662 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5751#true} {5751#true} #82#return; {5751#true} is VALID [2022-04-07 13:05:22,662 INFO L272 TraceCheckUtils]: 0: Hoare triple {5751#true} call ULTIMATE.init(); {5763#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 13:05:22,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {5763#(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; {5751#true} is VALID [2022-04-07 13:05:22,662 INFO L290 TraceCheckUtils]: 2: Hoare triple {5751#true} assume true; {5751#true} is VALID [2022-04-07 13:05:22,662 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5751#true} {5751#true} #102#return; {5751#true} is VALID [2022-04-07 13:05:22,662 INFO L272 TraceCheckUtils]: 4: Hoare triple {5751#true} call #t~ret7 := main(); {5751#true} is VALID [2022-04-07 13:05:22,662 INFO L290 TraceCheckUtils]: 5: Hoare triple {5751#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {5751#true} is VALID [2022-04-07 13:05:22,662 INFO L272 TraceCheckUtils]: 6: Hoare triple {5751#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {5751#true} is VALID [2022-04-07 13:05:22,662 INFO L290 TraceCheckUtils]: 7: Hoare triple {5751#true} ~cond := #in~cond; {5751#true} is VALID [2022-04-07 13:05:22,662 INFO L290 TraceCheckUtils]: 8: Hoare triple {5751#true} assume !(0 == ~cond); {5751#true} is VALID [2022-04-07 13:05:22,662 INFO L290 TraceCheckUtils]: 9: Hoare triple {5751#true} assume true; {5751#true} is VALID [2022-04-07 13:05:22,663 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5751#true} {5751#true} #82#return; {5751#true} is VALID [2022-04-07 13:05:22,663 INFO L290 TraceCheckUtils]: 11: Hoare triple {5751#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {5751#true} is VALID [2022-04-07 13:05:22,663 INFO L290 TraceCheckUtils]: 12: Hoare triple {5751#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5751#true} is VALID [2022-04-07 13:05:22,663 INFO L290 TraceCheckUtils]: 13: Hoare triple {5751#true} assume !!(#t~post5 < 5);havoc #t~post5; {5751#true} is VALID [2022-04-07 13:05:22,663 INFO L290 TraceCheckUtils]: 14: Hoare triple {5751#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5751#true} is VALID [2022-04-07 13:05:22,663 INFO L290 TraceCheckUtils]: 15: Hoare triple {5751#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5751#true} is VALID [2022-04-07 13:05:22,663 INFO L290 TraceCheckUtils]: 16: Hoare triple {5751#true} assume !!(#t~post5 < 5);havoc #t~post5; {5751#true} is VALID [2022-04-07 13:05:22,663 INFO L290 TraceCheckUtils]: 17: Hoare triple {5751#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5751#true} is VALID [2022-04-07 13:05:22,663 INFO L290 TraceCheckUtils]: 18: Hoare triple {5751#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5751#true} is VALID [2022-04-07 13:05:22,663 INFO L290 TraceCheckUtils]: 19: Hoare triple {5751#true} assume !!(#t~post5 < 5);havoc #t~post5; {5751#true} is VALID [2022-04-07 13:05:22,663 INFO L290 TraceCheckUtils]: 20: Hoare triple {5751#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5751#true} is VALID [2022-04-07 13:05:22,663 INFO L290 TraceCheckUtils]: 21: Hoare triple {5751#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5751#true} is VALID [2022-04-07 13:05:22,663 INFO L290 TraceCheckUtils]: 22: Hoare triple {5751#true} assume !!(#t~post5 < 5);havoc #t~post5; {5751#true} is VALID [2022-04-07 13:05:22,663 INFO L290 TraceCheckUtils]: 23: Hoare triple {5751#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5751#true} is VALID [2022-04-07 13:05:22,663 INFO L290 TraceCheckUtils]: 24: Hoare triple {5751#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5751#true} is VALID [2022-04-07 13:05:22,663 INFO L290 TraceCheckUtils]: 25: Hoare triple {5751#true} assume !!(#t~post5 < 5);havoc #t~post5; {5751#true} is VALID [2022-04-07 13:05:22,663 INFO L290 TraceCheckUtils]: 26: Hoare triple {5751#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5751#true} is VALID [2022-04-07 13:05:22,664 INFO L290 TraceCheckUtils]: 27: Hoare triple {5751#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5760#(<= (+ |main_#t~post5| 1) ~counter~0)} is VALID [2022-04-07 13:05:22,664 INFO L290 TraceCheckUtils]: 28: Hoare triple {5760#(<= (+ |main_#t~post5| 1) ~counter~0)} assume !(#t~post5 < 5);havoc #t~post5; {5761#(<= 6 ~counter~0)} is VALID [2022-04-07 13:05:22,665 INFO L290 TraceCheckUtils]: 29: Hoare triple {5761#(<= 6 ~counter~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5762#(<= 6 |main_#t~post6|)} is VALID [2022-04-07 13:05:22,665 INFO L290 TraceCheckUtils]: 30: Hoare triple {5762#(<= 6 |main_#t~post6|)} assume !!(#t~post6 < 5);havoc #t~post6; {5752#false} is VALID [2022-04-07 13:05:22,665 INFO L272 TraceCheckUtils]: 31: Hoare triple {5752#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {5752#false} is VALID [2022-04-07 13:05:22,665 INFO L290 TraceCheckUtils]: 32: Hoare triple {5752#false} ~cond := #in~cond; {5752#false} is VALID [2022-04-07 13:05:22,665 INFO L290 TraceCheckUtils]: 33: Hoare triple {5752#false} assume 0 == ~cond; {5752#false} is VALID [2022-04-07 13:05:22,665 INFO L290 TraceCheckUtils]: 34: Hoare triple {5752#false} assume !false; {5752#false} is VALID [2022-04-07 13:05:22,665 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-04-07 13:05:22,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:05:22,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378053117] [2022-04-07 13:05:22,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378053117] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 13:05:22,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 13:05:22,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 13:05:22,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423418175] [2022-04-07 13:05:22,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 13:05:22,666 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 35 [2022-04-07 13:05:22,666 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:05:22,666 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-07 13:05:22,679 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-07 13:05:22,679 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 13:05:22,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:05:22,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 13:05:22,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-07 13:05:22,680 INFO L87 Difference]: Start difference. First operand 142 states and 177 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-07 13:05:32,298 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:05:33,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:05:33,735 INFO L93 Difference]: Finished difference Result 179 states and 226 transitions. [2022-04-07 13:05:33,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 13:05:33,735 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 35 [2022-04-07 13:05:33,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:05:33,736 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-07 13:05:33,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2022-04-07 13:05:33,737 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-07 13:05:33,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2022-04-07 13:05:33,737 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 78 transitions. [2022-04-07 13:05:33,802 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-07 13:05:33,804 INFO L225 Difference]: With dead ends: 179 [2022-04-07 13:05:33,804 INFO L226 Difference]: Without dead ends: 139 [2022-04-07 13:05:33,805 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-07 13:05:33,805 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 10 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 12 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-07 13:05:33,805 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.4s Time] [2022-04-07 13:05:33,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-04-07 13:05:33,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 134. [2022-04-07 13:05:33,857 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:05:33,857 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states. Second operand has 134 states, 79 states have (on average 1.1518987341772151) internal successors, (91), 81 states have internal predecessors, (91), 39 states have call successors, (39), 16 states have call predecessors, (39), 15 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-07 13:05:33,857 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand has 134 states, 79 states have (on average 1.1518987341772151) internal successors, (91), 81 states have internal predecessors, (91), 39 states have call successors, (39), 16 states have call predecessors, (39), 15 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-07 13:05:33,857 INFO L87 Difference]: Start difference. First operand 139 states. Second operand has 134 states, 79 states have (on average 1.1518987341772151) internal successors, (91), 81 states have internal predecessors, (91), 39 states have call successors, (39), 16 states have call predecessors, (39), 15 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-07 13:05:33,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:05:33,860 INFO L93 Difference]: Finished difference Result 139 states and 172 transitions. [2022-04-07 13:05:33,860 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 172 transitions. [2022-04-07 13:05:33,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:05:33,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:05:33,861 INFO L74 IsIncluded]: Start isIncluded. First operand has 134 states, 79 states have (on average 1.1518987341772151) internal successors, (91), 81 states have internal predecessors, (91), 39 states have call successors, (39), 16 states have call predecessors, (39), 15 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand 139 states. [2022-04-07 13:05:33,861 INFO L87 Difference]: Start difference. First operand has 134 states, 79 states have (on average 1.1518987341772151) internal successors, (91), 81 states have internal predecessors, (91), 39 states have call successors, (39), 16 states have call predecessors, (39), 15 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand 139 states. [2022-04-07 13:05:33,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:05:33,863 INFO L93 Difference]: Finished difference Result 139 states and 172 transitions. [2022-04-07 13:05:33,863 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 172 transitions. [2022-04-07 13:05:33,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:05:33,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:05:33,864 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:05:33,864 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:05:33,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 79 states have (on average 1.1518987341772151) internal successors, (91), 81 states have internal predecessors, (91), 39 states have call successors, (39), 16 states have call predecessors, (39), 15 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-07 13:05:33,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 166 transitions. [2022-04-07 13:05:33,866 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 166 transitions. Word has length 35 [2022-04-07 13:05:33,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:05:33,866 INFO L478 AbstractCegarLoop]: Abstraction has 134 states and 166 transitions. [2022-04-07 13:05:33,866 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-07 13:05:33,866 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 166 transitions. [2022-04-07 13:05:33,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-07 13:05:33,867 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:05:33,867 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-07 13:05:33,867 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-07 13:05:33,867 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:05:33,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:05:33,867 INFO L85 PathProgramCache]: Analyzing trace with hash 109392637, now seen corresponding path program 1 times [2022-04-07 13:05:33,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:05:33,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68535596] [2022-04-07 13:05:33,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:05:33,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:05:33,881 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 13:05:33,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [222446333] [2022-04-07 13:05:33,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:05:33,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:05:33,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:05:33,882 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-07 13:05:33,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process